Heesch's Problem

In geometry, the Heesch number of a shape is the maximum number of layers of copies of the same shape that can surround it. Heesch's problem is the problem of determining the set of numbers that can be Heesch numbers. Both are named for geometer Heinrich Heesch, who found a tile with Heesch number 1 (the union of a square, equilateral triangle, and 30-60-90 right triangle) and proposed the more general problem.

For example, a square may be surrounded by infinitely many layers of congruent squares in the square tiling, while a circle cannot be surrounded by even a single layer of congruent circles without leaving some gaps. The Heesch number of the square is infinite and the Heesch number of the circle is zero. In more complicated examples, such as the one shown in the illustration, a polygonal tile can be surrounded by several layers, but not by infinitely many; the maximum number of layers is the tile's Heesch number.

Formal definitions

A tessellation of the plane is a partition of the plane into smaller regions called tiles. The zeroth corona of a tile is defined as the tile itself, and for ''k'' > 0 the ''k''th corona is the set of tiles sharing a boundary point with the (''k'' − 1)th corona. The Heesch number of a figure ''S'' is the maximum value ''k'' such that there exists a tiling of the plane, and tile ''t'' within that tiling, for which that all tiles in the zeroth through ''k''th coronas of ''t'' are congruent to ''S''. In some work on this problem this definition is modified to additionally require that the union of the zeroth through ''k''th coronas of ''t'' is a simply connected region.

If there is no upper bound on the number of layers by which a tile may be surrounded, its Heesch number is said to be infinite. In this case, an argument based on Kőnig's lemma can be used to show that there exists a tessellation of the whole plane by congruent copies of the tile.

Example

Consider the non-convex polygon ''P'' shown in the figure to the right, which is formed from a regular hexagon by adding projections on two of its sides and matching indentations on three sides. The figure shows a tessellation consisting of 61 copies of ''P'', one large infinite region, and four small diamond-shaped polygons within the fourth layer. The first through fourth coronas of the central polygon consist entirely of congruent copies of ''P'', so its Heesch number is at least four. One cannot rearrange the copies of the polygon in this figure to avoid creating the small diamond-shaped polygons, because the 61 copies of ''P'' have too many indentations relative to the number of projections that could fill them. By formalizing this argument, one can prove that the Heesch number of ''P'' is exactly four. According to the modified definition that requires that coronas be simply connected, the Heesch number is three. This example was discovered by Robert Ammann.

Known results

It is unknown whether all positive integers can be Heesch numbers. The first examples of polygons with Heesch number 2 were provided by , who showed that infinitely many polyominoes have this property. Casey Mann has constructed a family of tiles, each with the Heesch number 5. Mann's tiles have Heesch number 5 even with the restricted definition in which each corona must be simply connected.. In 2020, Bojan Bašić found a figure with Heesch number 6, the highest finite number until the present.

For the corresponding problem in the hyperbolic plane, the Heesch number may be arbitrarily large.. English translation in ''Math. Notes'' 88 (1–2): 97–102, 2010, .

References

Sources

*
*

Further reading

*
*

External links

*
Numberphile video about Heesch Numbers

{{Tessellation

Tessellation