On the size of subsets of Fpn\mathbb{F}_p^{n} without pp distinct elements summing to zero

preprint2020arXivOpen access

Abstract

Let us fix a prime pp. The Erdős-Ginzburg-Ziv problem asks for the minimum integer ss such that any collection of ss points in the lattice Zn\mathbb{Z}^n contains pp points whose centroid is also a lattice point in Zn\mathbb{Z}^n. For large nn, this is essentially equivalent to asking for the maximum size of a subset of Fpn\mathbb{F}_p^n without pp distinct elements summing to zero. In this paper, we give a new upper bound for this problem for any fixed prime p≥5p\geq 5 and large nn. In particular, we prove that any subset of Fpn\mathbb{F}_p^n without pp distinct elements summing to zero has size at most Cp⋅(2p)nC_p\cdot \left(2\sqrt{p}\right)^n, where CpC_p is a constant only depending on pp. For pp and nn going to infinity, our bound is of the form p(1/2)⋅(1+o(1))np^{(1/2)\cdot (1+o(1))n}, whereas all previously known upper bounds were of the form p(1−o(1))np^{(1-o(1))n} (with pnp^n being a trivial bound). Our proof uses the so-called multi-colored sum-free theorem which is a consequence of the Croot-Lev-Pach polynomial method. This method and its consequences were already applied by Naslund as well as by Fox and the author to prove bounds for the problem studied in this paper. However, using some key new ideas, we significantly improve their bounds.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.