Metraipolis › archive › dc_77ed16a4e208

Edge-addition monotonicity of positive p-energy fails for every p >= 1 — arXiv:2609.13476

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.13476
License (as archived)
CC0-1.0
Archived
2026-10-15T22:48:29.823Z
SHA-256 of the archived text
ac7710a92f97b29b1f585445cc87e8ffbceaf02d9c59394c80615b96ecd20d6b
Stable URL of this page
https://metraipolis.com/documento/dc_77ed16a4e208

How to cite

Edge-addition monotonicity of positive p-energy fails for every p >= 1 — arXiv:2609.13476 — arXiv (en), https://arxiv.org/abs/2609.13476 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_77ed16a4e208 (Metraipolis archive dc_77ed16a4e208, sha256 ac7710a92f97b29b1f585445cc87e8ffbceaf02d9c59394c80615b96ecd20d6b)
BibTeX
@misc{dc77ed16a4e208,
  title = {Edge-addition monotonicity of positive p-energy fails for every p >= 1 — arXiv:2609.13476},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.13476},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_77ed16a4e208; sha256 ac7710a92f97b29b1f585445cc87e8ffbceaf02d9c59394c80615b96ecd20d6b},
  year = {2026}
}

Archived text

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

At a 2021 AIM workshop, Guo conjectured that the positive square energy s+ = E+_2 should inherit the familiar edge-addition monotonicity of the spectral radius, rho(G + uv) >= rho(G). That conjecture was subsequently shown to fail at p = 2. Tang, Liu, and Wang then introduced positive p-energy, proved nonmonotonicity for every 1 <= p < 3, and in version 3 of their preprint (26 March 2025) explicitly conjectured that monotonicity should hold for p >= 3. We disprove this conjectured high-exponent extension completely: for every real p > 2 there are infinitely many connected graphs G and nonedges uv such that E+_p(G + uv) < E+_p(G). Together with the Tang-Liu-Wang counterexamples below 3, this shows that no exponent p >= 1 restores the spectral-radius-style monotonicity: positive p-energy can decrease under the addition of an edge for every real p >= 1. The construction is a chain of clique blocks joined by regular bipartite graphs. An equitable quotient converges to Q = I + cA(P_k). For noninteger p, a binomial-series sign argument for a fractional power of I - cA(P_k) gives the required negative endpoint entry. At integer exponents, choosing c across the first spectral threshold leaves exactly one negative eigenvalue, and path locality forces the positive spectral contribution to have negative sign. We also give a fully rational 38-vertex certificate at p = 4 and determine the complete failure interval of a fixed 17-vertex counterexample at p = 3.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-15 in cs.AI).
Categorie arXiv: Combinatorics (math.CO) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2609.13476 — 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-15T22:29:03.488Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).