Exponential Lower Bounds on the Generalized Erdos-Ginzburg-Ziv Constant
Abstract
For a finite abelian group G, the generalized Erdos--Ginzburg--Ziv constant sk(G) is the smallest m such that a sequence of m elements in G always contains a k-element subsequence which sums to zero. If n = (G) is the exponent of G, the previously best known bounds for skn(Cnr) were linear in n and r when k 2. Via a probabilistic argument, we produce the exponential lower bound \[ s2n(Cnr) > n2[1.25 - O(n-3/2)]r \] for n > 0. For the general case, we show \[ skn(Cnr) > kn4(1+1ek + O(1n))r. \]
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.