A new proof of the Lemmens-Seidel conjecture
Preprint
Abstract
In this paper, we give a new proof of the Lemmens-Seidel conjecture on the maximum number of equiangular lines with a common angle $\arccos(1/5)$. This conjecture was previously resolved by Cao, Koolen, Lin, and Yu in 2022 through an analysis involving forbidden subgraphs for the smallest Seidel eigenvalue $-5$. Our new proof is based on bounds on eigenvalue multiplicities of graphs with degree no larger than $14$. To control the maximum degree of the graph associated with equiangular lines, we employ a recent inequality of Balla derived by matrix projection techniques. Our strategy also leads to a new proof for the classical result obtained by Lemmens and Seidel in 1973 for the case where the common angle is $\arccos(1/3)$.
Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Equiangular lines via matrix projectionAdvances in Mathematics, 2025
- The Lemmens-Seidel conjecture and forbidden subgraphsJournal of Combinatorial Theory, Series A, 2022
- Forbidden Subgraphs for Graphs of Bounded Spectral Radius, with Applications to Equiangular LinesIsrael Journal of Mathematics, 2020
- Equiangular lines and spherical codes in Euclidean spaceInventiones Mathematicae, 2017
- New Bounds for Equiangular Lines and Spherical Two-Distance SetsSIAM Journal on Discrete Mathematics, 2017
- Equiangular lines in Euclidean spacesJournal of Combinatorial Theory, Series A, 2016
- Bounds on Equiangular Lines and on Related Spherical CodesSIAM Journal on Discrete Mathematics, 2016
- Large sets of complex and real equiangular linesJournal of Combinatorial Theory, Series A, 2015
- Large Equiangular Sets of Lines in Euclidean SpaceThe Electronic Journal of Combinatorics, 2000
- STRONGLY REGULAR GRAPHS OF L2-TYPE AND OF TRIANGULAR TYPE1991