Metraipolis › archive › dc_652cf2825332
Havel--Hakimi Residues of Common-Divisor Graphs: Complete Asymptotics and Prime-Counting Structure — arXiv:2608.04040
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.04040
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T11:45:55.646Z
- SHA-256 of the archived text
701664b01d18c5181cb963cd9621e0f6a06b9c6c382355d6d69b5eec5601b31b- Stable URL of this page
https://metraipolis.com/documento/dc_652cf2825332
How to cite
Havel--Hakimi Residues of Common-Divisor Graphs: Complete Asymptotics and Prime-Counting Structure — arXiv:2608.04040 — arXiv (en), https://arxiv.org/abs/2608.04040 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_652cf2825332 (Metraipolis archive dc_652cf2825332, sha256 701664b01d18c5181cb963cd9621e0f6a06b9c6c382355d6d69b5eec5601b31b)
BibTeX
@misc{dc652cf2825332,
title = {Havel--Hakimi Residues of Common-Divisor Graphs: Complete Asymptotics and Prime-Counting Structure — arXiv:2608.04040},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.04040},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_652cf2825332; sha256 701664b01d18c5181cb963cd9621e0f6a06b9c6c382355d6d69b5eec5601b31b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.04040. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $G_n$ be the graph on $\{2,\ldots,n\}$ in which two integers are adjacent when they have a common divisor greater than one. We determine the complete asymptotic expansion of its Havel--Hakimi residue $\R(G_n)$, confirming a leading-constant prediction of Staton recorded in Fajtlowicz's \emph{Written on the Wall}. If $A=\sum_{k=2}^{\infty}(\log k)/(k^2(k-1))$, then the first two terms are $\R(G_n)=(\zeta(2)-1)n/\log n+(\zeta(2)-1-A)n/\log^2n +O(n/\log^3n)$. More precisely, the difference between $\R(G_n)$ and the prime-vertex contribution to the Caro--Wei sum is $O_\beta(n\exp\{-(\log n)^\beta\})$ for every fixed $0<\beta<1/2$; this estimate yields every coefficient in the expansion. The upper bound follows from a degree-preserving realization in which almost all relevant prime vertices are partitioned into cliques. We also prove that the unlabeled graph determines $\pi(n)$ through its simplicial true-twin classes. Stable inverses for weighted sums of the resulting degree-class counts give criteria equivalent to the Riemann hypothesis, including one involving only the Caro--Wei sum. An exact local-defect identity additionally reduces the conjectured sharp $+2$ residue bound to explicit prefix estimates.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-06 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.04040 — 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-31T11:35:10.095Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-06?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).