# Equiangular lines and large multiplicity of fixed second eigenvalue

## TL;DR

This paper demonstrates the existence of infinitely many angles where the maximum number of lines meeting at the origin in ^n exceeds a linear function of n by a logarithmic factor, using novel graph constructions.

## Contribution

It constructs regular graphs with fixed second eigenvalue and large multiplicity, advancing understanding of equiangular lines and eigenvalue multiplicities.

## Key findings

- Existence of infinitely many angles with high line configurations
- Construction of regular graphs with prescribed eigenvalues and large multiplicity
- New distribution method on bipartite graph factors

## Abstract

Answering a question of Jiang and Polyanskii as well as Jiang, Tidor, Yao, Zhang, and Zhao, we show the existence of infinitely many angles $\theta$ for which the maximum number of lines in $\mathbb R^n$ meeting at the origin with pairwise angles $\theta$ exceeds $n+\Omega(\log\log n)$ but is at most $n+o(n)$. To accomplish this, we construct, for various real $\lambda$ and integer $d$, $d$-regular graphs with second eigenvalue exactly $\lambda$ and arbitrarily large second eigenvalue multiplicity. Central to our construction is a distribution on factors of bipartite graphs which possesses concentration properties.