Jiang–Tidor–Yao–Zhang–Zhao bounded-error conjecture for equiangular lines

Let α(0,1)\alpha\in(0,1), define

λ=1α2α,\lambda=\frac{1-\alpha}{2\alpha},

and let κ=κ(λ)\kappa=\kappa(\lambda) be the spectral radius order of λ\lambda, namely the least number of vertices of a graph whose largest adjacency-matrix eigenvalue is λ\lambda, or \infty if no such graph exists. Jiang–Tidor–Yao–Zhang–Zhao conjecture. If κ=\kappa=\infty, then

Nα(d)=d+Oα(1).N_{\alpha}(d)=d+O_{\alpha}(1).

The source states that this remains open to determine the set of λ\lambda for which the conjecture holds, although it has been confirmed when λ\lambda is not a totally real algebraic integer.

Sources & referencesView supporting material

Primary source

Chuanyuan Ge and Shiping Liu, “Equiangular lines via nodal domains”, arXiv:2507.09511 (2025).

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.