arXiv · 2611.21470
A proof of the Reinhardt conjecture
Abstract
We prove the Reinhardt conjecture: among centrally symmetric convex disks in the plane, the smoothed regular octagon has the least optimal lattice packing density, and equality holds precisely for its nonsingular affine images. The proof combines explicit bounds on the number of control arcs, local cost inequalities and rigorous finite verification of the remaining switching types.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Fei Xue. 2026-11-16. A proof of the Reinhardt conjecture. https://searcharxiv.com/abs/2611.21470
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.