Jiang–Polyanskii conjecture on the bounded secondary term for equiangular lines

For α(0,1)\alpha\in(0,1), let λ=(1α)/(2α)\lambda=(1-\alpha)/(2\alpha), and let k(λ)k(\lambda) denote the minimum number of vertices of a graph whose largest eigenvalue is exactly λ\lambda, or \infty if no such graph exists. Jiang–Polyanskii conjecture. If k(λ)=k(\lambda)=\infty, then

Nα(n)=n+Oα(1).N_\alpha(n)=n+O_\alpha(1).

The quantity Nα(n)N_\alpha(n) concerns the maximum size of a family of equiangular lines with common angle parameter α\alpha. The conjecture would determine the secondary term in the k(λ)=k(\lambda)=\infty case, strengthening the known estimate Nα(n)=n+o(n)N_\alpha(n)=n+o(n); its status is not resolved in the supplied source.

Sources & referencesView supporting material

Primary source

Carl Schildkraut, “Equiangular lines and large multiplicity of fixed second eigenvalue”, arXiv:2302.12230 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.