English

Exponential Lower Bounds on the Generalized Erd\H{o}s-Ginzburg-Ziv Constant

Combinatorics 2021-12-03 v2

Abstract

For a finite abelian group GG, the generalized Erd\H{o}s--Ginzburg--Ziv constant sk(G)\mathsf s_{k}(G) is the smallest mm such that a sequence of mm elements in GG always contains a kk-element subsequence which sums to zero. If n=exp(G)n = \exp(G) is the exponent of GG, the previously best known bounds for skn(Cnr)\mathsf s_{kn}(C_n^r) were linear in nn and rr when k2k\ge 2. Via a probabilistic argument, we produce the exponential lower bound s2n(Cnr)>n2[1.25O(n3/2)]r \mathsf s_{2n}(C_n^r) > \frac{n}{2}[1.25 - O(n^{-3/2})]^r for n>0n > 0. For the general case, we show skn(Cnr)>kn4(1+1ek+O(1n))r. \mathsf s_{kn}(C_n^r) > \frac{kn}{4}\Big(1+\frac{1}{ek} + O\Big(\frac{1}{n}\Big)\Big)^r.

Keywords

Cite

@article{arxiv.1712.00861,
  title  = {Exponential Lower Bounds on the Generalized Erd\H{o}s-Ginzburg-Ziv Constant},
  author = {Jared Bitz and Sarah Griffith and Xiaoyu He},
  journal= {arXiv preprint arXiv:1712.00861},
  year   = {2021}
}

Comments

5 pages