Erdos-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions

Abstract

For a finite abelian group G, the Erdos-Ginzburg-Ziv constant s(G) is the smallest s such that every sequence of s (not necessarily distinct) elements of G has a zero-sum subsequence of length exp(G). For a prime p, let r(Fpn) denote the size of the largest subset of Fpn without a three-term arithmetic progression. Although similar methods have been used to study s(G) and r(Fpn), no direct connection between these quantities has previously been established. We give an upper bound for s(G) in terms of r(Fpn) for the prime divisors p of exp(G). For the special case G=Fpn, we prove s(Fpn)≤ 2p· r(Fpn). Using the upper bounds for r(Fpn) of Ellenberg and Gijswijt, this result improves the previously best known upper bounds for s(Fpn) given by Naslund.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…