On the Reinhardt conjecture

zbMATH Open1239.52002arXiv1103.4518MaRDI QIDQ763577FDOQ763577

Thomas C. Hales

Publication date: 29 March 2012

Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)

Abstract: In 1934, Reinhardt asked for the centrally symmetric convex domain in the plane whose best lattice packing has the lowest density. He conjectured that the unique solution up to an affine transformation is the smoothed octagon (an octagon rounded at corners by arcs of hyperbolas). This article offers a detailed strategy of proof. In particular, we show that the problem is an instance of the classical problem of Bolza in the calculus of variations. A minimizing solution is known to exist. The boundary of every minimizer is a differentiable curve with Lipschitz continuous derivative. If a minimizer is piecewise analytic, then it is a smoothed polygon (a polygon rounded at corners by arcs of hyperbolas). To complete the proof of the Reinhardt conjecture, the assumption of piecewise analyticity must be removed, and the conclusion of smoothed polygon must be strengthened to smoothed octagon.

Full work available at URL: https://arxiv.org/abs/1103.4518

zbMATH Keywords

lattice packingsconvex centrally symmetric domain in~\({\mathbb R}^2\)Reinhardt conjecture

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)

Cited In (8)

• A contribution to Reich's conjecture
• On a conjecture of Auslander and Reiten
• Critical loci of convex domains in the plane
• On conjecture of Resnikoff and Saldaña
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the theorem of Reichert

This page was built for publication: On the Reinhardt conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763577)