betaFeedback

WorksMathematics

Cyclic fibers and exponential lower bounds for Erdős–Ginzburg–Ziv constants

Abstract

We show that for every integer n≥2n\ge2 that is not a power of two there are constants cn>0c_n>0 and Bn>2B_n>2 such that s(Cnr)≥cnBnrs(C_n^r)\ge c_nB_n^r for all r≥1r\ge1. For powers of two, Harborth's formula gives growth rate exactly 22. For the remaining even exponents, the previous lower bounds were of order r2rr2^r. When n=2mn=2m with m≥3m\ge3 odd, we prove the transfer inequality An(H⊕Cn5) ≥ 12 An(H⊕Cn)+8 An(H⊕Cm), A_n(H\oplus C_n^5)\ \ge\ 12\,A_n(H\oplus C_n)+8\,A_n(H\oplus C_m), where An(G)A_n(G) is the maximal length of a sequence over GG without an nn-term zero-sum subsequence and HH is any finite abelian group whose exponent divides nn. The transfer extends a configuration of Elsholtz to twenty full cyclic fibers. Combined with a nine-point binary construction for 2m2m-term zero-sums over CmrC_m^r, it gives bases at least 2.03412.0341 that tend to 2.0394…2.0394\ldots; combined with a finite-field construction, it gives s(C6r)≥c⋅2.0491rs(C_6^r)\ge c\cdot 2.0491^r. For exponents divisible by 44 that are not powers of two, we obtain a base above two from a weighted random construction on the eighteen-point configuration of Wang and Zeng.

Paper details

vlnc:W_r4eb4vsg
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 3

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…