Equiangular lines via improved eigenvalue multiplicity

TL;DR

This paper determines the maximum number of equiangular lines in high-dimensional spaces with specific angles, improving previous bounds by leveraging new eigenvalue multiplicity bounds.

Contribution

It provides improved bounds on the maximum number of equiangular lines for certain angles and dimensions, extending prior results with novel eigenvalue multiplicity techniques.

Findings

Maximum equiangular lines in high dimensions are characterized for specific angles.

New upper bounds on eigenvalue multiplicities lead to tighter bounds on equiangular lines.

Results extend previous bounds from doubly exponential to exponential in certain regimes.

Abstract

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 $\mathbb{R}^r$ with a common angle of $\arccos{\frac{1}{2k-1}}$ for any integer $k \geq 2$. We show that the answer equals $r-1+\left\lfloor\frac{r-1}{k-1}\right\rfloor,$ 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 [Ann. of Math. (2) 194 (2021), no. 3, 729-743], 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{\alpha}$, the answer equals $r+o(r)$ already when $r$ is superpolynomial in $1/\alpha \to \infty$. 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 [STOC 2021, pp. 396-407].