English

Exponential Bounds for the Erd\H{o}s-Ginzburg-Ziv Constant

Combinatorics 2023-03-13 v3 Number Theory

Abstract

The Erd\H{o}s-Ginzburg-Ziv constant of an abelian group GG, denoted s(G)\mathfrak{s}(G), is the smallest kNk\in\mathbb{N} such that any sequence of elements of GG of length kk contains a zero-sum subsequence of length exp(G)\exp(G). In this paper, we use the partition rank, which generalizes the slice rank, to prove that for any odd prime pp, s(Fpn)(p1)2p(J(p)p)n \mathfrak{s}\left(\mathbb{F}_{p}^{n}\right)\leq(p-1)2^{p}\left(J(p)\cdot p\right)^{n} where 0.8414<J(p)<0.918370.8414<J(p)<0.91837 is the constant appearing in Ellenberg and Gijswijt's bound on arithmetic progression-free subsets of Fpn\mathbb{F}_{p}^{n}. For large nn, and p>3p>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\left(\mathbb{Z}/k\mathbb{Z}\right)^{n} satisfies property DD, showing that in this case s((Z/kZ)n)(k1)4n+k. \mathfrak{s}\left(\left(\mathbb{Z}/k\mathbb{Z}\right)^{n}\right)\leq(k-1)4^{n}+k.

Keywords

Cite

@article{arxiv.1701.04942,
  title  = {Exponential Bounds for the Erd\H{o}s-Ginzburg-Ziv Constant},
  author = {Eric Naslund},
  journal= {arXiv preprint arXiv:1701.04942},
  year   = {2023}
}

Comments

14 pages. Several updates