The Hexagonal Honeycomb Conjecture

From MaRDI portal





The general conjecture that the hexagonal honeycomb is the least-perimeter way to enclose and separate infinitely many regions of unit area in the plane is still open (despite mathematical folklore to the contrary). Some restricted versions of it have been solved; but there are many possible variations, both in what constitutes a legal set of regions (may there be empty space? must the regions be connected?) and in how the perimeter shall be compared. In general, it is not even known whether there exists an optimal solution to some of these problems. It is known that, for any finite \(n\), there is a cluster of \(n\) unit-area cells achieving the minimum perimeter, although the exact nature of the minimizing cluster is unknown in most cases. By piecing together such clusters, the author shows the existence of an infinite cluster that achieves the minimal limiting perimeter-to-area ratio. The resulting infinite cluster has large empty spaces between its finite components; it is not known whether the same result can be obtained without allowing empty space, or whether a better solution might be found using disconnected regions. Another version of the problem requires the total perimeter within large balls to be minimized, without permitting empty space (that is, faces with infinite area or finite area greater than 1) or (again) disconnected regions. The author shows that there must exist a partition of the plane which achieves this minimum.











This page was built for publication: The Hexagonal Honeycomb Conjecture

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