Metraipolis › archive › dc_3ecf8a2d0c4c

The fourth generalized Davenport constant of $C_5^3$ — arXiv:2609.04950

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.04950
License (as archived)
CC0-1.0
Archived
2026-10-16T23:21:25.265Z
SHA-256 of the archived text
fd896e106fc46ed483557bab2e6c7411bfc8e8ef78b0faa40ed48e19fe383077
Stable URL of this page
https://metraipolis.com/documento/dc_3ecf8a2d0c4c

How to cite

The fourth generalized Davenport constant of $C_5^3$ — arXiv:2609.04950 — arXiv (en), https://arxiv.org/abs/2609.04950 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3ecf8a2d0c4c (Metraipolis archive dc_3ecf8a2d0c4c, sha256 fd896e106fc46ed483557bab2e6c7411bfc8e8ef78b0faa40ed48e19fe383077)
BibTeX
@misc{dc3ecf8a2d0c4c,
  title = {The fourth generalized Davenport constant of $C_5^3$ — arXiv:2609.04950},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.04950},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3ecf8a2d0c4c; sha256 fd896e106fc46ed483557bab2e6c7411bfc8e8ef78b0faa40ed48e19fe383077},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.04950. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

For a finite abelian group $G$ and $k \geq 1$, the generalized Davenport constant $D_k(G)$ is the least $\ell$ such that every sequence over $G$ of length at least $\ell$ has $k$ pairwise disjoint nonempty zero-sum subsequences. A theorem of Freeze and Schmid gives $D_k(C_5^3) \geq 5k+10$ for every $k \geq 2$. We prove the matching upper bound: $D_4(C_5^3)=30$, and hence $D_k(C_5^3)=5k+10$ for every $k \geq 2$, so the Freeze--Schmid bound is attained by $C_5^3$ from $k=2$ onward, as it is by $C_2^3$ and unlike $C_3^3$. The proof is finite and computer-assisted. The remaining case reduces to showing that every zero-sum sequence of length $31$ over $C_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\}$, its support pattern to one of $60$ solutions of two linear equations, and its geometry to one of $78$ 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, $D_3(C_5^3)=25$ and $s_{\leq 6}(C_5^3)=24$, enter the second statement, and their records accompany the paper.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-07 in math.CO).
Categorie arXiv: Discrete Mathematics (cs.DM) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.04950 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T23:03:13.280Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).