We conjecture that our techniques apply to a configuration if and only if the linear programming bounds for spherical codes prove a sharp bound for it.
Statement
We conjecture that our techniques apply to a configuration if and only if the linear programming bounds for spherical codes prove a sharp bound for it. We conjecture that they prove universal optimality for the hexagonal lattice in R2 , the E8 root lattice in R8 , and the Leech lattice in R24 .
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.