Equiangular lines via improved eigenvalue multiplicity

Zoom Link

A family of lines passing through the origin in an inner product space is said to be equiangular if every pair of lines defines the same angle. In 1973, Lemmens and Seidel raised what has since become a central question in the study of equiangular lines in Euclidean spaces. They asked for the maximum number of equiangular lines in R^r with a common angle of arccos(1/(2k-1)) for any positive integer k. We show that the answer equals r-1+floor((r-1)/(k-1)), provided that r is at least exponential in a polynomial in k. This improves upon a recent breakthrough of Jiang, Tidor, Yao, Zhang, and Zhao, who showed that this holds for r at least doubly exponential in a polynomial in k. We also show that for any common angle arccos a, the answer equals r+o(r) already when r is superpolynomial in 1/a as it tends to infinity. The key new ingredient underlying our results is an improved upper bound on the multiplicity of the second-largest eigenvalue of a graph. In one of the regimes, this improves and significantly extends a result of McKenzie, Rasmussen, and Srivastava.