Honeycomb conjecture
The honeycomb conjecture states that a regular hexagonal grid or honeycomb has the least total perimeter of any subdivision of the plane into regions of equal area. The conjecture was proven in 1999 by mathematician Thomas C. Hales.[1]
Theorem
Let [math]\displaystyle{ \Gamma }[/math] be any system of smooth curves in [math]\displaystyle{ \mathbb{R}^2 }[/math], subdividing the plane into regions (connected components of the complement of [math]\displaystyle{ \Gamma }[/math]) all of which are bounded and have unit area. Then, averaged over large disks in the plane, the average length of [math]\displaystyle{ \Gamma }[/math] per unit area is at least as large as for the hexagon tiling. The theorem applies even if the complement of [math]\displaystyle{ \Gamma }[/math] has additional components that are unbounded or whose area is not one; allowing these additional components cannot shorten [math]\displaystyle{ \Gamma }[/math]. Formally, let [math]\displaystyle{ B(0,r) }[/math] denote the disk of radius [math]\displaystyle{ r }[/math] centered at the origin, let [math]\displaystyle{ L_r }[/math] denote the total length of [math]\displaystyle{ \Gamma\cap B(0,r) }[/math], and let [math]\displaystyle{ A_r }[/math] denote the total area of [math]\displaystyle{ B(0,r) }[/math] covered by bounded unit-area components. (If these are the only components, then [math]\displaystyle{ A_r=\pi r^2 }[/math].) Then the theorem states that [math]\displaystyle{ \limsup_{r\to\infty} \frac{L_r}{A_r}\ge\sqrt[4]{12}. }[/math] The value on the right hand side of the inequality is the limiting length per unit area of the hexagonal tiling.
History
The first record of the conjecture dates back to 36 BC, from Marcus Terentius Varro, but is often attributed to Pappus of Alexandria (c. 290 – c. 350).[2] In the 17th century, Jan Brożek used a similar theorem to argue why bees create hexagonal honeycombs. In 1943, László Fejes Tóth published a proof for a special case of the conjecture, in which each cell is required to be a convex polygon.[3] The full conjecture was proven in 1999 by mathematician Thomas C. Hales, who mentions in his work that there is reason to believe that the conjecture may have been present in the minds of mathematicians before Varro.[1][2]
It is also related to the densest circle packing of the plane, in which every circle is tangent to six other circles, which fill just over 90% of the area of the plane.
The case when the problem is restricted to a square grid was solved in 1989 by Jaigyoung Choe who proved that the optimal figure is a irregular hexagon.[4][5]
See also
- Weaire–Phelan structure, a counter-example to the Kelvin conjecture on the solution of the similar problem in 3D.
References
- ↑ 1.0 1.1 Hales, Thomas C. (January 2001). "The Honeycomb Conjecture". Discrete and Computational Geometry 25 (1): 1–22. doi:10.1007/s004540010071.
- ↑ 2.0 2.1 Weisstein, Eric W.. "Honeycomb Conjecture". MathWorld. http://mathworld.wolfram.com/HoneycombConjecture.html. Retrieved 27 Dec 2010.
- ↑ Fejes, László (1943). "Über das kürzeste Kurvennetz, das eine Kugeloberfläche in flächengleiche konvexe Teile zerlegt". Math. Naturwiss. Anz. Ungar. Akad. Wiss. 62: 349–354.
- ↑ Choe, Jaigyoung (1989-01-01). "On the existence and regularity of fundamental domains with least boundary area". Journal of Differential Geometry 29 (3). doi:10.4310/jdg/1214443065. ISSN 0022-040X. https://projecteuclid.org/journals/journal-of-differential-geometry/volume-29/issue-3/On-the-existence-and-regularity-of-fundamental-domains-with-least/10.4310/jdg/1214443065.full.
- ↑ Cepelewicz, Jordana. "Mathematicians Complete Quest to Build 'Spherical Cubes'". https://www.quantamagazine.org/mathematicians-complete-quest-to-build-spherical-cubes-20230210/.
 |  |
