Exponential Bounds for the Erdos-Ginzburg-Ziv Constant
Abstract
The Erdos-Ginzburg-Ziv constant of an abelian group G, denoted s(G), is the smallest k∈N such that any sequence of elements of G of length k contains a zero-sum subsequence of length (G). In this paper, we use the partition rank, which generalizes the slice rank, to prove that for any odd prime p, \[ s(Fpn)≤(p-1)2p(J(p)· p)n \] where 0.8414<J(p)<0.91837 is the constant appearing in Ellenberg and Gijswijt's bound on arithmetic progression-free subsets of Fpn. For large n, and p>3, this is the first exponential improvement to the trivial bound. We also provide a near optimal result conditional on the conjecture that (Z/kZ)n satisfies property D, showing that in this case \[ s((Z/kZ)n)≤(k-1)4n+k. \]
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.