ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let χlat(Rn)\chi_{\mathrm{lat}}(\mathbb{R}^n) denote the minimum number of colors in a lattice coloring of Rn\mathbb{R}^n such that no two points of the same color are at Euclidean distance 11. The conjecture asserts that χlat(R4)=49\chi_{\mathrm{lat}}(\mathbb{R}^4)=49 and χlat(R5)=140\chi_{\mathrm{lat}}(\mathbb{R}^5)=140; equivalently, there are lattice colorings with 4949 and 140140 colors, respectively, and no lattice colorings with fewer colors.

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.