On generalized Erd\H{o}s-Ginzburg-Ziv constants of $C_n^r$
Dongchun Han, Hanbin Zhang

TL;DR
This paper investigates the generalized Erdős-Ginzburg-Ziv constants for groups of the form $C_n^r$, providing asymptotic formulas and bounds that support Kubertin's conjecture for various parameters.
Contribution
The paper proves asymptotic formulas and bounds for the generalized Erdős-Ginzburg-Ziv constants of $C_n^r$, extending previous conjectures and results in additive combinatorics.
Findings
For $k extgreater 6$, $ extsf{s}_{kn}(C_n^3)=(k+3)n+O(n/\ln n)$.
For $k extgreater 18$, $ extsf{s}_{kn}(C_n^4)=(k+4)n+O(n/\ln n)$.
Bounds for $ extsf{s}_{kp^tn}(C_n^r)$ when the largest prime power divisor of $n$ is $p^a$, supporting conjectural values.
Abstract
Let be an additive finite abelian group with exponent . For any positive integer , the -th generalized Erd\H{o}s-Ginzburg-Ziv constant is defined as the smallest positive integer such that every sequence in of length at least has a zero-sum subsequence of length . It is easy to see that where . Kubertin conjectured that the equality holds for any . In this paper, we mainly prove the following results: (1) For every positive integer , we have (2) For every positive integer , we have (3) For , assume that the largest prime power divisor of is for some . For any fixed , if for some…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · graph theory and CDMA systems · Finite Group Theory Research
