On the size of subsets of F_p^n without p distinct elements summing to zero

18 February 2020
14:00
Lisa Sauermann
Abstract

Let us fix a prime $p$. The Erdős-Ginzburg-Ziv problem asks for the minimum integer $s$ such that any collection of $s$ points in the lattice $\mathbb{Z}^n$ contains $p$ points whose centroid is also a lattice point in $\mathbb{Z}^n$. For large $n$, this is essentially equivalent to asking for the maximum size of a subset of $\mathbb{F}_p^n$ without $p$ distinct elements summing to zero.

In this talk, we discuss a new upper bound for this problem for any fixed prime $p\geq 5$ and large $n$. Our proof uses the so-called multi-colored sum-free theorem which is a consequence of the Croot-Lev-Pach polynomial method, as well as some new combinatorial ideas.

  • Combinatorial Theory Seminar