On the Reinhardt conjecture

From MaRDI portal



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.


The article under review suggests a detailed strategy of a proof of the Reinhardt Conjecture. Let \(K\) be a convex centrally symmetric domain in~\({\mathbb R}^2\). Given a rank 2 lattice \(\Lambda \subset {\mathbb R}^2\) such that the translates of \(K\) by points of \(\Lambda\) have disjoint interiors, define the packing density of \(\Lambda+K\) to be \[ \delta_{\Lambda}(K) = \frac{\text{Area}(K)}{\det(\Lambda)}, \] and let \(\delta(K)\) be the maximum of \(\delta_{\Lambda}(K)\) taken over all such lattice packings of~\(K\). Let \[ \delta_{\min} = \inf \{ \delta(K) : K \text{ a convex centrally symmetric domain in } {\mathbb R}^2 \}. \] Reinhardt proved that \(\delta_{\min}\) is attained, and posed the problem to determine \(\delta_{\min}\) and to explicitly describe \(K\) for which \(\delta(K)=\delta_{\min}\). Furthermore, he conjectured that this \(K\) is a smoothed octagon, that is a regular octagon the corners of which are clipped with hyperbolic arcs chosen so that there is a unique tangent at each point of the boundary. It is known that for such an octagon \(K\), \[ \delta(K) = \frac{8-\sqrt{32}-\ln 2}{\sqrt{8}-1} \approx 0.902414. \] The author of the present paper gives a brief overview of previous work done in the direction of this conjecture. He then outlines an approach to the conjecture, using calculus of variations and nonlinear optimization techniques.











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)