Metraipolis › archive › dc_9538592b6837

Energy Maximisation for Integral Circulant Graphs with Opposite-Parity Exponents — arXiv:2608.29523

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.29523
License (as archived)
CC0-1.0
Archived
2026-10-17T09:31:02.992Z
SHA-256 of the archived text
ff025b0308b68fb3c96fb83f14ff34d9a8a7226465ee6d09332c24fc00498038
Stable URL of this page
https://metraipolis.com/documento/dc_9538592b6837

How to cite

Energy Maximisation for Integral Circulant Graphs with Opposite-Parity Exponents — arXiv:2608.29523 — arXiv (en), https://arxiv.org/abs/2608.29523 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9538592b6837 (Metraipolis archive dc_9538592b6837, sha256 ff025b0308b68fb3c96fb83f14ff34d9a8a7226465ee6d09332c24fc00498038)
BibTeX
@misc{dc9538592b6837,
  title = {Energy Maximisation for Integral Circulant Graphs with Opposite-Parity Exponents — arXiv:2608.29523},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.29523},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9538592b6837; sha256 ff025b0308b68fb3c96fb83f14ff34d9a8a7226465ee6d09332c24fc00498038},
  year = {2026}
}

Archived text

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

For a finite graph, its energy is the sum of the absolute values of its adjacency eigenvalues. Let p and q be distinct odd primes with q at least 5, and let r be at least 1 and s be nonnegative. We determine the maximum energy among all integral circulant graphs whose order is p to the power 2r times q to the power 2s plus 1. The unique energy-maximising divisor set is the checkerboard set consisting of all divisors p raised to the power i times q raised to the power j, where i ranges from zero to 2r, j ranges from zero to 2s plus 1, and i plus j is even, and we obtain an explicit closed formula for the corresponding maximum energy. In particular, for q at least 5, when r and s are both equal to 1, our theorem establishes the conjectured maximality of Roldan's checkerboard divisor set and recovers his closed-form energy formula. The main ingredient is a semidefinite parity theorem for weighted prime-power Ramanujan transforms, proved by a parity-independent congruence reduction and a block Schur recurrence. Centring the divisor matrix then yields a sharp sign-matrix inequality from semidefinite bounds for a Kronecker-product operator. Analysing equality identifies the checkerboard pattern and proves uniqueness.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-01 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.29523 — 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-17T09:02:28.827Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).