Equiangular lines via nodal domains
Combinatorics
2025-07-15 v1 Differential Geometry
Spectral Theory
Abstract
For given and , we show that the maximum multiplicity that can appear as the second largest eigenvalue of a connected graph with maximum degree at most is . This result answers a question due to Jiang, Tidor, Yao, Zhang and Zhao [Question 6.4, Ann. of Math. (2) 194 (2021), no. 3, 729-743] in the case of , and consequently leads to improvements in their results on equiangular lines. Our proof is based on the concept of nodal domains of eigenfunctions. Indeed, we establish a multiplicity estimate in terms of maximum degree and cyclomatic number of the graph, via a novel construction of eigenfunctions with large number of nodal domains.
Cite
@article{arxiv.2507.09511,
title = {Equiangular lines via nodal domains},
author = {Chuanyuan Ge and Shiping Liu},
journal= {arXiv preprint arXiv:2507.09511},
year = {2025}
}
Comments
10 pages, 1 figure