Erd\H{o}s-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions
Jacob Fox, Lisa Sauermann

TL;DR
This paper establishes a new upper bound for the Erd ext{o}s-Ginzburg-Ziv constant of finite abelian groups by relating it to the size of large progression-free subsets in finite fields, improving previous bounds.
Contribution
It introduces a novel connection between Erd ext{o}s-Ginzburg-Ziv constants and progression-free sets, providing sharper bounds for groups of the form _p^n.
Findings
Derived an upper bound for (G) in terms of progression-free set sizes
Proved (_p^n) \u2264 2p (_p^n) for prime p
Improved previous bounds for (_p^n) using Ellenberg-Gijswijt bounds
Abstract
For a finite abelian group , the Erd\H{o}s-Ginzburg-Ziv constant is the smallest such that every sequence of (not necessarily distinct) elements of has a zero-sum subsequence of length . For a prime , let denote the size of the largest subset of without a three-term arithmetic progression. Although similar methods have been used to study and , no direct connection between these quantities has previously been established. We give an upper bound for in terms of for the prime divisors of . For the special case , we prove . Using the upper bounds for of Ellenberg and Gijswijt, this result improves…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Finite Group Theory Research · Analytic Number Theory Research
