Metraipolis › archive › dc_057f4bb654be

New upper bounds for the chromatic numbers of Euclidean spaces — arXiv:2609.20436

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.20436
License (as archived)
CC0-1.0
Archived
2026-10-10T04:47:23.820Z
SHA-256 of the archived text
fb26aaacce9b290851de61043190a393330785cb5f5a65bf63290668058a1e6d
Stable URL of this page
https://metraipolis.com/documento/dc_057f4bb654be

How to cite

New upper bounds for the chromatic numbers of Euclidean spaces — arXiv:2609.20436 — arXiv (en), https://arxiv.org/abs/2609.20436 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_057f4bb654be (Metraipolis archive dc_057f4bb654be, sha256 fb26aaacce9b290851de61043190a393330785cb5f5a65bf63290668058a1e6d)
BibTeX
@misc{dc057f4bb654be,
  title = {New upper bounds for the chromatic numbers of Euclidean spaces — arXiv:2609.20436},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.20436},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_057f4bb654be; sha256 fb26aaacce9b290851de61043190a393330785cb5f5a65bf63290668058a1e6d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20436. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A coloring of $\R^n$ is \emph{proper for the forbidden distance segment} $[1,\ell]$ if no two points of the same color are at a distance from $[1,\ell]$; the minimum number of colors is $\chi(\R^n,[1,\ell])$, and $\ell=1$ gives the classical chromatic number $\chi(\R^n)$ of the Nelson--Hadwiger problem. We prove the new upper bounds $\chi(\R^4)\le43$, $\chi(\R^5)\le132$, $\chi(\R^7)\le1029$, $\chi(\R^9)\le7203$, $\chi(\R^{10})\le45619$, improving the previously known $49$, $140$, $1372$, $17253$ and $3^{10}$; in particular, this refutes the conjecture of Arman, Bondarenko, Prymak and Radchenko that $49$ and $140$ are optimal among all lattice colorings of $\R^4$ and $\R^5$. The first four bounds come from explicit rational lattices --- an Eisenstein lattice in $\R^4$, a lattice in general position in $\R^5$, and laminations of the Eisenstein colorings $E_6^*/343$ and $E_8/2401$ in $\R^7$ and $\R^9$ --- and each is reduced, by one verification protocol, to a finite list of inequalities between explicitly written rational numbers checked in exact arithmetic. The fifth bound is analytic: we prove that for every Eisenstein lattice $\Lambda$ the distance between same-colored cells of $(3+\omega)\Lambda$ equals $\sqrt{7/3}\,\lambda_1(\Lambda)$, which gives the exact widths of all known colorings with $7^{n/2}$ colors, and a product rule $\sum_i1/d_i^2\le1$ for the widths of orthogonal products; together they yield $45619=2401\cdot19$, the first bound in $\R^{10}$ below $3^n$, as well as $\chi(\R^{25})\le4\cdot7^{12}$ and $\chi(\R^{26})\le19\cdot7^{12}$. We also show that no sublattice of $E_8$ of index below $2401$ defines a proper coloring. All code, exact certificates and data are open.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.20436 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T04:15:33.151Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).