Metraipolis › archive › dc_6ffd6d290f65

A Multiplicative Fourier Proof of the Length-Four Index Conjecture — arXiv:2608.12310

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.12310
License (as archived)
CC0-1.0
Archived
2026-10-19T05:47:53.138Z
SHA-256 of the archived text
252cafa40eeac4963a23db5453e80e082e74dfc484115a2b9c71915c9e1bc2fe
Stable URL of this page
https://metraipolis.com/documento/dc_6ffd6d290f65

How to cite

A Multiplicative Fourier Proof of the Length-Four Index Conjecture — arXiv:2608.12310 — arXiv (en), https://arxiv.org/abs/2608.12310 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6ffd6d290f65 (Metraipolis archive dc_6ffd6d290f65, sha256 252cafa40eeac4963a23db5453e80e082e74dfc484115a2b9c71915c9e1bc2fe)
BibTeX
@misc{dc6ffd6d290f65,
  title = {A Multiplicative Fourier Proof of the Length-Four Index Conjecture — arXiv:2608.12310},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.12310},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6ffd6d290f65; sha256 252cafa40eeac4963a23db5453e80e082e74dfc484115a2b9c71915c9e1bc2fe},
  year = {2026}
}

Archived text

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

Let $C_n$ be a cyclic group of order $n$. We prove that if $(n,6)=1$, then every minimal zero-sum sequence of length four over $C_n$ has index one, thereby resolving the length-four index conjecture. After the gcd reduction, the nonunit case follows from the theorem of Shen-Xia-Li, and the remaining unit case is solved by a new multiplicative Fourier argument. The index-two residue identity yields a character-moment relation, and the odd characters with vanishing first moment form an exceptional spectrum of size at most $157\varphi(n)/1440<\varphi(n)/9$. A finite-group uncertainty principle then forces the four-term multiset to be invariant under negation, contradicting minimality. Apart from standard facts about primitive Dirichlet $L$-functions, the remaining argument is finite and requires neither asymptotic estimates nor computational verification.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-13 in math.CO).
Categorie arXiv: Number Theory (math.NT) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.12310 — 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-19T05:40:33.676Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).