Arman–Bondarenko–Prymak–Radchenko lattice-coloring optimality conjecture
Statement
Let denote the minimum number of colors in a lattice coloring of such that no two points of the same color are at Euclidean distance . The conjecture asserts that and ; equivalently, there are lattice colorings with and colors, respectively, and no lattice colorings with fewer colors.
Record
- Added
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.