Metraipolis › archive › dc_00cbdadee3e9

Quadratic inequalities between the largest eigenvalues of a graph — arXiv:2609.37980

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.37980
License (as archived)
CC0-1.0
Archived
2026-10-07T18:33:51.385Z
SHA-256 of the archived text
fc7d482791b44310d79084de2eef9571f43060e518ef4e6693e2edc85e5301d6
Stable URL of this page
https://metraipolis.com/documento/dc_00cbdadee3e9

How to cite

Quadratic inequalities between the largest eigenvalues of a graph — arXiv:2609.37980 — arXiv (en), https://arxiv.org/abs/2609.37980 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_00cbdadee3e9 (Metraipolis archive dc_00cbdadee3e9, sha256 fc7d482791b44310d79084de2eef9571f43060e518ef4e6693e2edc85e5301d6)
BibTeX
@misc{dc00cbdadee3e9,
  title = {Quadratic inequalities between the largest eigenvalues of a graph — arXiv:2609.37980},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.37980},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_00cbdadee3e9; sha256 fc7d482791b44310d79084de2eef9571f43060e518ef4e6693e2edc85e5301d6},
  year = {2026}
}

Archived text

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

We prove a sharp quadratic inequality between the largest two eigenvalues $\lambda_1 \ge \lambda_2$ of a graph with $n$ vertices. We also prove a quadratic inequality between the second and third largest eigenvalues $\lambda_2 \ge \lambda_3$. These results in particular imply the bounds $\lambda_1 + \lambda_2 \le \frac{8}{7} n - 2$, $\lambda_3 \le \frac{n}{3} - 1$ and $\lambda_2 + \lambda_3 \le \frac{2}{3} n - 2$. In fact we determine the closure of the set of possible $(\frac{\lambda_1+1}{n}, \frac{\lambda_2+1}{n}) \in \mathbb{R}^2$ and $(\frac{\lambda_2+1}{n}, \frac{\lambda_3+1}{n}) \in \mathbb{R}^2$. More generally, we prove quadratic bounds in the case of symmetric matrices in $[0,1]^{n \times n}$, and we also give a quadratic bound for two eigenvalues of a symmetric matrix in $[-1,1]^{n \times n}$. These bounds are proved by transforming the problem into extremal geometric questions in $\mathbb{R}^3$ and $\mathbb{R}^2$. We use the method of Lagrange multipliers to reduce to special cases with at most five points, and we deal with these special cases directly.

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