no. 16 · Tuesday 17 November 2026
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.
- comments
- The purpose of this paper is to show that the conjecture can be resolved. The present proof is long, and the author hopes that further work will lead to a shorter and more beautiful proof
- fields
- Metric Geometry, Optimization and Control