Smoothed octagon#Reinhardt's conjecture

File:Smoothed Octagon.svg

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.{{r|lagerungen}} The following details apply to a regular octagon of circumradius $\backslash sqrt\{2\}$ with its centre at the point $(2+\backslash sqrt\{2\},0)$ and one vertex at the point $(2,0)$. For two constants $\backslash ell=\backslash sqrt\{2\}\; -\; 1$ and $m=(1/2)^\{1/4\}$, the hyperbola is given by the equation

$$$$

\ell^2x^2-y^2=m^2

or the equivalent parameterization (for the right-hand branch only)

$$$$

\begin{align}

x&=\frac{m}{\ell} \cosh{t}\\

y&= m \sinh{t}\\

\end{align}

for the portion of the hyperbola that forms the corner, given by the range of parameter values

$$$$

-\frac{\ln{2}}{4}

The lines of the octagon tangent to the hyperbola are $y=\; \backslash pm\; \backslash left(\backslash sqrt\{2\}\; +\; 1\; \backslash right)\; \backslash left(\; x-2\; \backslash right)$,

and the lines asymptotic to the hyperbola are simply $y\; =\; \backslash pm\; \backslash ell\; x$.

File:SmoothedOctagonPackings.gif

File:SmoothedOctagonCorners.gif

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.{{r|ft-packing}} 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.{{r|kallus-pessimal}}

The smoothed octagon has a maximum packing density given by{{r|mahler|lagerungen}}

$$$$

\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{{r|lagerungen}}

$$$$

\frac{\pi}{\sqrt{12}} \approx 0.906899.

The maximum known packing density of the ordinary regular octagon is

$$\backslash frac\{4\; +\; 4\; \backslash sqrt\{2\}\}\{5\; +\; 4\; \backslash sqrt\{2\}\}\; \backslash approx\; 0.906163,$$

also slightly less than the maximum packing density of circles, but higher than that of the smoothed octagon.{{r|ajt}}

{{clear}}

{{unsolved|mathematics|Is the smoothed octagon the centrally symmetric convex shape with the lowest maximum packing density?}}

{{anchor|1=Reinhardt's conjecture}}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.{{cite arXiv |last1=Hales |first1=Thomas |title=Packings of Smoothed Polygons |date=2024-05-07 |eprint = 2405.04331 |last2=Vajjha |first2=Koundinya|class=math.OC }}{{Cite web |last=Barber |first=Gregory |date=28 June 2024 |title=Why Is This Shape So Terrible to Pack? |url=https://www.quantamagazine.org/why-is-this-shape-so-terrible-to-pack-20240628 |access-date=28 June 2024 |website=Quanta Magazine}} 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.{{r|nazarov}}

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.{{r|kallus-pessimal}}

{{Reflist|refs=

{{cite journal

| last1 = Atkinson | first1 = Steven

| last2 = Jiao | first2 = Yang

| last3 = Torquato | first3 = Salvatore

| arxiv = 1405.0245

| bibcode = 2012PhRvE..86c1302A

| date = September 10, 2012

| doi = 10.1103/physreve.86.031302

| issue = 3

| journal = Physical Review E

| page = 031302

| pmid = 23030907

| s2cid = 9806947

| title = Maximally dense packings of two-dimensional convex and concave noncircular particles

| volume = 86}}

{{cite journal

| last = Fejes Tóth | first = László | author-link = László Fejes Tóth

| journal = Acta Universitatis Szegediensis

| mr = 38086

| pages = 62–67

| title = Some packing and covering theorems

| volume = 12

| year = 1950}}

{{cite journal

| last = Kallus | first = Yoav

| arxiv = 1305.0289

| doi = 10.2140/gt.2015.19.343

| issue = 1

| journal = Geometry & Topology

| mr = 3318753

| pages = 343–363

| title = Pessimal packing shapes

| volume = 19

| year = 2015}}

{{cite book

| last1 = Fejes Tóth | first1 = László | author1-link = László Fejes Tóth

| last2 = Fejes Tóth | first2 = Gábor

| last3 = Kuperberg | first3 = Włodzimierz | author3-link = Włodzimierz Kuperberg

| doi = 10.1007/978-3-031-21800-2

| isbn = 978-3-031-21799-9

| location = Cham

| mr = 4628019

| page = [https://books.google.com/books?id=0xe2EAAAQBAJ&pg=PA106 106]

| publisher = Springer

| series = Grundlehren der mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]

| title = Lagerungen: Arrangements in the Plane, on the Sphere, and in Space

| volume = 360

| year = 2023}}

{{cite journal

| last = Mahler | first = Kurt | author-link = Kurt Mahler

| journal = Indagationes Mathematicae

| mr = 21017

| pages = 326–337

| title = On the minimum determinant and the circumscribed hexagons of a convex domain

| url = https://dwc.knaw.nl/DL/publications/PU00018367.pdf

| volume = 9

| year = 1947}}

{{cite journal

| last = Nazarov | first = F. L. | author-link = Fedor Nazarov

| doi = 10.1007/BF01727653

| journal = Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta imeni V. A. Steklova Akademii Nauk SSSR (LOMI)

| mr = 849319

| pages = 104–114, 197–198

| title = On the Reinhardt problem of lattice packings of convex regions: Local extremality of the Reinhardt octagon

| volume = 151

| year = 1986}}

{{cite journal

| last = Reinhardt | first = Karl | author-link = Karl Reinhardt (mathematician)

| doi = 10.1007/BF02940676

| journal = Abh. Math. Sem. Univ. Hamburg

| pages = 216–230

| s2cid = 120336230

| title = Über die dichteste gitterförmige Lagerung kongruenter Bereiche in der Ebene und eine besondere Art konvexer Kurven

| volume = 10

| year = 1934}}

}}

• [https://blogs.ams.org/visualinsight/2014/11/01/packing-smoothed-octagons/ Packing smoothed octagons]. John Baez, Visual Insight, AMS Blogs, 2014.
• [http://www.home.unix-ag.org/scholl/octagon.html The thinnest densest two-dimensional packing?]. Peter Scholl, 2001.

Category:Packing problems