Indexed metadata

The fourth generalized Davenport constant of C53C_5^3

Sze Chun Yiu

Source record

Source: arXiv

Published: Sep 4, 2026

arXiv: 2609.04950

Open original source ↗

Source abstract

For a finite abelian group GG and k1k \geq 1, the generalized Davenport constant Dk(G)D_k(G) is the least \ell such that every sequence over GG of length at least \ell has kk pairwise disjoint nonempty zero-sum subsequences. A theorem of Freeze and Schmid gives Dk(C53)5k+10D_k(C_5^3) \geq 5k+10 for every k2k \geq 2. We prove the matching upper bound: D4(C53)=30D_4(C_5^3)=30, and hence Dk(C53)=5k+10D_k(C_5^3)=5k+10 for every k2k \geq 2, so the Freeze--Schmid bound is attained by C53C_5^3 from k=2k=2 onward, as it is by C23C_2^3 and unlike C33C_3^3. The proof is finite and computer-assisted. The remaining case reduces to showing that every zero-sum sequence of length 3131 over C53C_5^3 contains a nonempty zero-sum subsequence of length at most five. A saturation argument confines the multiplicities of a hypothetical counterexample to {1,2,4}\{1,2,4\}, its support pattern to one of 6060 solutions of two linear equations, and its geometry to one of 7878 rank/plane branches normalized to a standard basis; an exhaustive search exhausts every branch with no survivor. The search was carried out by three independently written implementations, and the branch cover was regenerated by separate programs from the lemmas alone; two further machine-verified values, D3(C53)=25D_3(C_5^3)=25 and s6(C53)=24s_{\leq 6}(C_5^3)=24, enter the second statement, and their records accompany the paper.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.