Jiang–Polyanskii conjecture on the bounded secondary term for equiangular lines
Statement
For , let , and let denote the minimum number of vertices of a graph whose largest eigenvalue is exactly , or if no such graph exists. Jiang–Polyanskii conjecture. If , then
The quantity concerns the maximum size of a family of equiangular lines with common angle parameter . The conjecture would determine the secondary term in the case, strengthening the known estimate ; its status is not resolved in the supplied source.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.