Metraipolis › archive › dc_28f3db869be4
A twelve-term exclusion for the small Davenport constant of $E_2\times C_3^r$ — arXiv:2609.22972
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.22972
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T21:44:43.275Z
- SHA-256 of the archived text
f89264cf1fd55fe08fddfd01d467549c9c3e0adcef94bd230195892d6172ea2b- Stable URL of this page
https://metraipolis.com/documento/dc_28f3db869be4
How to cite
A twelve-term exclusion for the small Davenport constant of $E_2\times C_3^r$ — arXiv:2609.22972 — arXiv (en), https://arxiv.org/abs/2609.22972 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_28f3db869be4 (Metraipolis archive dc_28f3db869be4, sha256 f89264cf1fd55fe08fddfd01d467549c9c3e0adcef94bd230195892d6172ea2b)
BibTeX
@misc{dc28f3db869be4,
title = {A twelve-term exclusion for the small Davenport constant of $E_2times C_3^r$ — arXiv:2609.22972},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.22972},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_28f3db869be4; sha256 f89264cf1fd55fe08fddfd01d467549c9c3e0adcef94bd230195892d6172ea2b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.22972. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $E_2$ be the extraspecial group of order $3^5$ and exponent three. For every $r\ge1$, we prove that a product-one-free sequence of length $2r+11$ over $E_2\times C_3^r$ cannot contain exactly $2r-1$ central terms. Thus the critical layer with twelve noncentral terms is excluded. The proof combines a relative moment criterion for abelian normal subgroups with a finite theorem in a symplectic four-space over $\mathbb F_3$. Under explicit subspace occupancy bounds, the family of balanced triangles that can actually be completed to a nonfull zero-sum block admits edge weights summing to one on every triangle. A dual cycle argument reduces this assertion to a potential condition on branching edges. All remaining configurations contain one of eleven minimal frames; two separately implemented exhaustive checks verify all their admissible extensions. The unrestricted check has 9544046 leaves. Complete source code and execution records are supplied. The exact value of $\mathsf{d}(E_2\times C_3^r)$ for arbitrary $r$ is not determined by this result.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Group Theory (math.GR).
Pagina del lavoro: https://arxiv.org/abs/2609.22972 — 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-09T21:26:41.102Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).