Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 15 min ago
PreprintCC BY 4.0arXiv

Edge-addition monotonicity of positive p-energy fails for every p >= 1

Abstract

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.

Related

  1. Sharp monotonicity for closed three-manifolds with positive scalar curvature
    Cosmin Manea
    arXivPreprintarXiv licenceFull textAnalysis & PDEsGeometry & topologyarXiv
  2. The addition on totally positive integers uniquely determines the totally real number field
    Vitezslav Kala, Ritoprovo Roy
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  3. Green-Function Monotonicity under Positive Bakry-Émery Curvature
    Yu-Zhao Wang, Zeng-Ting Wu
    arXivPreprintCC BY 4.0Full textGeometry & topologyarXiv
  4. Every Closed Oriented Surface of Positive Genus Is Loewner
    Qiongling Li
    arXivPreprintCC BY 4.0Full textGeometry & topologyarXiv
  5. Eigenspaces of Preserved Graph Laplacian Eigenvalues under Positive Edge-Weight Addition
    Maribel Bueno, Susana Furtado, Javier Pérez
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
BibTeX
@misc{afrasyab2026edgeaddition,
  title = {{Edge-addition monotonicity of positive p-energy fails for every p >= 1}},
  author = {Koyar Afrasyab},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.13476},
  eprint = {2609.13476},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.13476},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Edge-addition monotonicity of positive p-energy fails for every p >= 1
AU  - Koyar Afrasyab
PY  - 2026
DA  - 2026/09/11
PB  - arXiv
DO  - 10.48550/arxiv.2609.13476
UR  - https://arxiv.org/abs/2609.13476
AB  - 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.
ER  -