The 24-cell conjecture in the all-contact case and near D4
Version 1 / Nov 12, 2026 / CC BY 4.0
Abstract
The 24-cell conjecture states that every Voronoi cell of a packing of unit balls in has volume at least , the volume of the regular 24-cell. It implies that no packing of equal balls in is denser than the lattice packing . We prove the conjecture for two classes of cells; in each class, equality holds only for the root configuration. The first consists of the cells whose ball touches every ball centred at distance less than from its centre, and its proof uses a certificate at the second level of the Lasserre hierarchy. The second consists of the cells whose nearest centres lie in an explicit neighbourhood of the configuration, whatever the other centres are. For them the volume is at least plus a fixed multiple of the total outward displacement of the centres, which we prove by a quantitative rigidity estimate and a second-order expansion of the volume about . Our proofs for both classes are computer-assisted and partly formalised in Lean.
References
- F. Johansson, Arb: efficient arbitrary-precision midpoint-radius interval arithmetic , IEEE Trans. Comput. 66 (2017), 1281--1292.
- D. Bhattacharjee, U. Bhattacharya, P. Mandal and S. Bhattacharya, The sphere packing problem in dimension 4 and the twenty-four-cell conjecture , arXiv:2609.25120v2 (2026).arXiv
- D. Bhattacharjee, U. Bhattacharya, P. Mandal and S. Bhattacharya, The sphere packing problem in dimension 4 and the twenty-four-cell conjecture , unrefereed draft, file paper/D4.tex at commit c85496134f (21 October 2026) of https://github.com/creelie/d4-voronoi-cells.link
- K. C. Chung and T. H. Yao, On lattices admitting unique Lagrange interpolations , SIAM J. Numer. Anal. 14 (1977), 735--743.
- H. Cohn, D. de Laat and A. Salmon, Three-point bounds for sphere packing , arXiv:2206.15373 (2022).arXiv
- H. Cohn, Y. Jiao, A. Kumar and S. Torquato, Rigidity of spherical codes , Geom. Topol. 15 (2011), 2235--2273.
- D. de Laat and F. Vallentin, A semidefinite programming hierarchy for packing problems in discrete geometry , Math. Program. 151 (2015), 529--553.
- L. Fejes Tóth, Lagerungen in der Ebene, auf der Kugel und im Raum , Springer, Berlin, 1953.
- T. C. Hales and S. McLaughlin, The dodecahedral conjecture , J. Amer. Math. Soc. 23 (2010), 299--344.
- A. Korkine and G. Zolotareff, Sur les formes quadratiques positives quaternaires , Math. Ann. 5 (1872), 581--583.
Show all 16 referencesShow fewer references
- D. de Laat, N. M. Leijenhorst and W. H. H. de Muinck Keizer, Optimality and uniqueness of the root system , arXiv:2404.18794 (2024).arXiv
- N. M. Leijenhorst and D. de Laat, Solving clustered low-rank semidefinite programs arising from polynomial optimization , Math. Program. Comput. 16 (2024), 503--534.
- O. R. Musin, The kissing number in four dimensions , Ann. of Math. 168 (2008), 1--32.
- O. R. Musin, Towards a proof of the 24-cell conjecture , Acta Math. Hungar. 155 (2018), 184--199.
- R. A. Nicolaides, On a class of finite elements generated by Lagrange interpolation , SIAM J. Numer. Anal. 9 (1972), 435--445.
- T. S. Tomar, Supplementary files for ``The 24-cell conjecture in the all-contact case and near '' , Zenodo (2026), doi: (https://doi.org/\suppdoi).link
Version history
- v1 · 24 pagesSubmitted by Tejasvi Singh TomarPublished on Zenodo: https://doi.org/10.5281/zenodo.23720963CurrentNov 12, 2026