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 ℤn contains p points whose centroid is also a lattice point in ℤ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 paper, we give a new upper bound for this problem for any fixed prime p ≥ 5 and large n. In particular, we prove that any subset of \(\mathbb{F}_p^n\) without p distinct elements summing to zero has size at most \({C_p} \cdot {\left( {2\sqrt p } \right)^n}\), where Cp is a constant only depending on p. For p and n going to infinity, our bound is of the form p(1/2)·(1+o(1))n, whereas all previously known upper bounds were of the form p(1−o(1))n (with pn 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.
Similar content being viewed by others
References
N. Alon and M. Dubiner, A lattice point problem and additive number theory, Combinatorica 15 (1995), 301–309.
N. Alon, A. Shpilka and C. Umans, On sunflowers and matrix multiplication, Computational Complexity 22 (2013), 219–243.
N. Alon and J. H. Spencer, The Probabilistic Method, Wiley Series in Discrete Mathematics and Optimization, Wiley, Hoboken, NJ, 2016.
J. Blasiak, T. Church, H. Cohn, J. A. Grochow, E. Naslund, W. F. Sawin and C. Umans, On cap sets and the group-theoretic approach to matrix multiplication, Discrete Analysis (2017), Article no. 3.
Y. Caro, New Results on the Independence Number, Technical Report, Tel-Aviv University, 1979.
E. Croot, V.F. Lev and P.P. Pach, Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small, Annals of Mathematics 185 (2017), 331–337.
Y. Edel, Extensions of generalized product caps, Designs, Codes and Cryptography 31 (2004), 5–14.
Y. Edel, Sequences in abelian groups G of odd order without zero-sum subsequences of length exp(G), Designs, Codes and Cryptography 47 (2008), 125–134.
Y. Edel, C. Elsholtz, A. Geroldinger, S. Kubertin and L. Rackham, Zero-sum problems in unite abelian groups and affine caps, Quarterly Journal of Mathematics 58 (2007), 159–186.
J. S. Ellenberg and D. Gijswijt, On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression, Annals of Mathematics 185 (2017), 339–343.
C. Elsholtz, Lower bounds for multidimensional zero sums, Combinatorica 24 (2004), 351–358.
P. Erdős, A. Ginzburg and A. Ziv, Theorem in the additive number theory, Bulletin of the Research Council of Israel 10F (1961), 41–43.
J. Fox and L. Sauermann, Erdős-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions, Electronic Journal of Combinatorics 25 (2018), Article no. P2.14.
J. A. Grochow, New applications of the polynomial method: the cap set conjecture and beyond, Bulletin of the American Mathematical Society 56 (2019), 29–64.
H. Harborth, Ein Extremalproblem für Gitterpunkte, Journal für die Reine und Angewandte Mathematik 262 (1973), 356–360.
G. Hegedüs, The Erdős-Ginzburg-Ziv constant and progression-free subsets, Journal of Number Theory 186 (2018), 238–247.
L. M. Lovász and L. Sauermann, A lower bound for the k-multicolored sum-free problem in \(\mathbb{Z}_m^n\), Proceedings of the London Mathematical Society 119 (2019), 55–103.
E. Naslund, The partition rank of a tensor and k-right corners in \(\mathbb{F}_q^n\), Journal of Combinatorial Theory. Series A 174 (2020), Article no. 105190.
E. Naslund, Exponential bounds for the Erdőos-Ginzburg-Ziv constant, Journal of Combinatorial Theory. Series A 174 (2020), Article no. 105185.
C. Reiher, On Kemnitz’ conjecture concerning lattice-points in the plane, Ramanujan Journal 13 (2007), 333–337.
T. Tao, A symmetric formulation of the Croot-Lev-Pach-Ellenberg-Gijswijt capset bound, blog post, 2016, http://terrytao.wordpress.eom/2016/05/18/a.
V. K. Wei, A Lower Bound on the Stability Number of a Simple Graph, Technical Memorandum, TM 81-11217-9, Bell Laboratories, 1981.
Acknowledgements
The author would like thank her advisor Jacob Fox for several helpful discussions and many useful comments on previous versions of this paper. Furthermore, the author would like to thank Masato Mimura, Yuta Suzuki and Norihide Tokushige for pointing out an error in the proof of Lemma 3.2 in a previous version of this paper. The author is also grateful to Christian Elsholtz for drawing her attention to several of the references. Finally, the author would like to thank the anonymous referee for their careful reading of the paper and their helpful comments.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sauermann, L. On the size of subsets of \(\mathbb{F}_p^n\) without p distinct elements summing to zero. Isr. J. Math. 243, 63–79 (2021). https://doi.org/10.1007/s11856-021-2145-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11856-021-2145-x