On dense tetrahedra in binary sphere packings
Mathematics of Computation · 2026-07-29
DOI: 10.1090/mcom/4265 ↗At a glance
Journal article in Mathematics of Computation, published on 2026-07-29. Written by Thomas Fernique and 1 co-authors.
Abstract (original language)
This paper considers the density of tetrahedra arising in a specific decomposition of packings of unequal spheres in $\mathbb{R}^3$. It aims to extend a bound obtained in 2D in the 1960s by Florian. The focus is on packings of spheres of sizes $1$ and $\sqrt{2}-1$: the small sphere fits exactly into each octahedral hole of a hexagonal close packing of large spheres, yielding a conjecturally maximally dense packing (for these sizes). The paper slightly improves, by completely different means, the previous best upper bound on the density of such packings. The proof combines geometric insight with challenging interval arithmetic computations, which may be of independent interest.
Cite
APA
Fernique, T., & Pchelina, D. (2026). On dense tetrahedra in binary sphere packings. Mathematics of Computation. https://doi.org/10.1090/mcom/4265
Vancouver
Fernique T, Pchelina D. On dense tetrahedra in binary sphere packings. Mathematics of Computation. 2026. doi:10.1090/mcom/4265
BibTeX
@article{Fernique2026,
author = {Fernique, Thomas and Pchelina, Daria},
title = {On dense tetrahedra in binary sphere packings},
journal = {Mathematics of Computation},
year = {2026},
doi = {10.1090/mcom/4265}
}
EUVIMED