Smoothed octagon

The smoothed octagon is a region in the plane found by Karl Reinhardt in 1934 and conjectured by him to have the lowest maximum packing density of the plane of all centrally symmetric convex shapes.^[1] It was also independently discovered by Kurt Mahler in 1947.^[2] It is constructed by replacing the corners of a regular octagon with a section of a hyperbola that is tangent to the two sides adjacent to the corner and asymptotic to the sides adjacent to these.

A smoothed octagon.

The family of maximally dense packings of the smoothed octagon.

Construction

The corners of the smoothed octagon can be found by rotating three regular octagons whose centres form a triangle with varying shape but constant area.

Construction of the smoothed octagon (black), the tangent hyperbola (red), the asymptotes of this hyperbola (green), and the tangent sides to the hyperbola (blue)

The hyperbola that forms each corner of the smoothed octagon is tangent to two sides of a regular octagon, and asymptotic to the two adjacent to these.^[3] The following details apply to a regular octagon of circumradius ${\displaystyle {\sqrt {2}}}$ with its centre at the point ${\displaystyle (2+{\sqrt {2}},0)}$ and one vertex at the point ${\displaystyle (2,0)}$. For two constants ${\displaystyle \ell ={\sqrt {2}}-1}$ and ${\displaystyle m=(1/2)^{1/4}}$, the hyperbola is given by the equation $${\displaystyle \ell ^{2}x^{2}-y^{2}=m^{2}}$$ or the equivalent parameterization (for the right-hand branch only) $${\displaystyle {\begin{aligned}x&={\frac {m}{\ell }}\cosh {t}\\y&=m\sinh {t}\\\end{aligned}}}$$

for the portion of the hyperbola that forms the corner, given by the range of parameter values $${\displaystyle -{\frac {\ln {2}}{4}}<t<{\frac {\ln {2}}{4}}.}$$

The lines of the octagon tangent to the hyperbola are ${\displaystyle y=\pm \left({\sqrt {2}}+1\right)\left(x-2\right)}$, and the lines asymptotic to the hyperbola are simply ${\displaystyle y=\pm \ell x}$.

Packing

For every centrally symmetric convex planar set, including the smoothed octagon, the maximum packing density is achieved by a lattice packing, in which unrotated copies of the shape are translated by the vectors of a lattice.^[4] The smoothed octagon achieves its maximum packing density, not just for a single packing, but for a 1-parameter family. All of these are lattice packings.^[5] The smoothed octagon has a maximum packing density given by^[2][3] $${\displaystyle {\frac {8-4{\sqrt {2}}-\ln {2}}{2{\sqrt {2}}-1}}\approx 0.902414\,.}$$

This is lower than the maximum packing density of circles, which is^[3] $${\displaystyle {\frac {\pi }{\sqrt {12}}}\approx 0.906899.}$$

The maximum known packing density of the ordinary regular octagon is $${\displaystyle {\frac {4+4{\sqrt {2}}}{5+4{\sqrt {2}}}}\approx 0.906163,}$$ also slightly less than the maximum packing density of circles, but higher than that of the smoothed octagon.^[6]

Unsolved problem in mathematics:

Is the smoothed octagon the centrally symmetric convex shape with the lowest maximum packing density?

(more unsolved problems in mathematics)

Reinhardt's conjecture that the smoothed octagon has the lowest maximum packing density of all centrally symmetric convex shapes in the plane remains unsolved. However, Thomas Hales and Koundinya Vajjha claimed to have proved a weaker conjecture, which asserts that the most unpackable centrally symmetric convex disk must be a smoothed polygon.^[7][8] Additionally, Fedor Nazarov provided a partial result by proving that the smoothed octagon is a local minimum for packing density among centrally symmetric convex shapes.^[9]

If central symmetry is not required, the regular heptagon is conjectured to have even lower packing density, but neither its packing density nor its optimality have been proven. In three dimensions, Ulam's packing conjecture states that no convex shape has a lower maximum packing density than the ball.^[5]

References

1. Reinhardt, Karl (1934). "Über die dichteste gitterförmige Lagerung kongruenter Bereiche in der Ebene und eine besondere Art konvexer Kurven". Abh. Math. Sem. Univ. Hamburg. 10: 216–230. doi:10.1007/BF02940676. S2CID 120336230.
2. Mahler, Kurt (1947). "On the minimum determinant and the circumscribed hexagons of a convex domain" (PDF). Indagationes Mathematicae. 9: 326–337. MR 0021017.
3. Fejes Tóth, László; Fejes Tóth, Gábor; Kuperberg, Włodzimierz (2023). Lagerungen: Arrangements in the Plane, on the Sphere, and in Space. Grundlehren der mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Vol. 360. Cham: Springer. p. 106. doi:10.1007/978-3-031-21800-2. ISBN 978-3-031-21799-9. MR 4628019.
4. Fejes Tóth, László (1950). "Some packing and covering theorems". Acta Universitatis Szegediensis. 12: 62–67. MR 0038086.
5. Kallus, Yoav (2015). "Pessimal packing shapes". Geometry & Topology. 19 (1): 343–363. arXiv:1305.0289. doi:10.2140/gt.2015.19.343. MR 3318753.
6. Atkinson, Steven; Jiao, Yang; Torquato, Salvatore (10 September 2012). "Maximally dense packings of two-dimensional convex and concave noncircular particles". Physical Review E. 86 (3): 031302. arXiv:1405.0245. Bibcode:2012PhRvE..86c1302A. doi:10.1103/physreve.86.031302. PMID 23030907. S2CID 9806947.
7. Hales, Thomas; Vajjha, Koundinya (7 May 2024). "Packings of Smoothed Polygons". arXiv:2405.04331 [math.OC].
8. Barber, Gregory (28 June 2024). "Why Is This Shape So Terrible to Pack?". Quanta Magazine. Retrieved 2024-06-28.
9. Nazarov, F. L. (1986). "On the Reinhardt problem of lattice packings of convex regions: Local extremality of the Reinhardt octagon". Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta imeni V. A. Steklova Akademii Nauk SSSR (LOMI). 151: 104–114, 197–198. doi:10.1007/BF01727653. MR 0849319.

External links

• Packing smoothed octagons. John Baez, Visual Insight, AMS Blogs, 2014.
• The thinnest densest two-dimensional packing?. Peter Scholl, 2001.