A proof of the Reinhardt conjecture

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.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.21470
Primary Topic
Point processes and geometric inequalities
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A proof of the Reinhardt conjecture

Fei Xue
arXiv (Cornell University)
Point processes and geometric inequalities
preprint

A proof of the Reinhardt conjecture

Fei Xue
preprint en

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.

arXiv (Cornell University)
Point processes and geometric inequalities
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon