Heesch's problem

Last updated
Original Heesch number 1 polygon (black) showing its decomposition into a square, and one and a half equilateral triangles, with its only layer (cyan; darker tiles needed to surround its respective vertex) Heesch number 1 parts.svg
Original Heesch number 1 polygon (black) showing its decomposition into a square, and one and a half equilateral triangles, with its only layer (cyan; darker tiles needed to surround its respective vertex)

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

Contents

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 polygon with Heesch number 6, found by Bojan Basic in 2020 A polygon with Heesch number 6.svg
A polygon with Heesch number 6, found by Bojan Bašić in 2020
A polygon with Heesch number 5, found by Casey Mann Heesch-5.svg
A polygon with Heesch number 5, found by Casey Mann
Ammann's example of a polygon with Heesch number 3 (or 4, depending on the definition) Amman-Heesch-4.svg
Ammann's example of a polygon with Heesch number 3 (or 4, depending on the definition)

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 kth 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 kth 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 kth coronas of t is a simply connected region. [5]

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. [6]

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. [5]

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 Fontaine (1991), who showed that infinitely many polyominoes have this property. [5] [7] 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. [5] In 2020, Bojan Bašić found a figure with Heesch number 6, the highest finite number until the present. [4]

History of the discoveries of shapes with finite Heesch numbers
Heesch numberDiscoveredDiscovered byShape
11928 Walther Lietzmann  [ de ] Lietzmann heesch 1.svg
11968 Heinrich Heesch Heesch 1.svg
21991 Anne Fontaine Fontaine heesch 2.svg
31990-1995 [8] Robert Ammann Amman-Heesch-4.svg
42001 [5] Casey Mann
52001 [5] Casey Mann Heesch-5.svg
62020 [4] Bojan Bašić Polygon with Heesch Number 6.png


For the corresponding problem in the hyperbolic plane, the Heesch number may be arbitrarily large. [9]

Related Research Articles

<span class="mw-page-title-main">Dual polyhedron</span> Polyhedron associated with another by swapping vertices for faces

In geometry, every polyhedron is associated with a second dual structure, where the vertices of one correspond to the faces of the other, and the edges between pairs of vertices of one correspond to the edges between pairs of faces of the other. Such dual figures remain combinatorial or abstract polyhedra, but not all can also be constructed as geometric polyhedra. Starting with any given polyhedron, the dual of its dual is the original polyhedron.

<span class="mw-page-title-main">Kite (geometry)</span> Quadrilateral symmetric across a diagonal

In Euclidean geometry, a kite is a quadrilateral with reflection symmetry across a diagonal. Because of this symmetry, a kite has two equal angles and two pairs of adjacent equal-length sides. Kites are also known as deltoids, but the word deltoid may also refer to a deltoid curve, an unrelated geometric object sometimes studied in connection with quadrilaterals. A kite may also be called a dart, particularly if it is not convex.

<span class="mw-page-title-main">Tessellation</span> Tiling of a plane in mathematics

A tessellation or tiling is the covering of a surface, often a plane, using one or more geometric shapes, called tiles, with no overlaps and no gaps. In mathematics, tessellation can be generalized to higher dimensions and a variety of geometries.

<span class="mw-page-title-main">Euclidean tilings by convex regular polygons</span> Subdivision of the plane into polygons that are all regular

Euclidean plane tilings by convex regular polygons have been widely used since antiquity. The first systematic mathematical treatment was that of Kepler in his Harmonices Mundi.

<span class="mw-page-title-main">Truncated square tiling</span>

In geometry, the truncated square tiling is a semiregular tiling by regular polygons of the Euclidean plane with one square and two octagons on each vertex. This is the only edge-to-edge tiling by regular convex polygons which contains an octagon. It has Schläfli symbol of t{4,4}.

<span class="mw-page-title-main">Elongated triangular tiling</span>

In geometry, the elongated triangular tiling is a semiregular tiling of the Euclidean plane. There are three triangles and two squares on each vertex. It is named as a triangular tiling elongated by rows of squares, and given Schläfli symbol {3,6}:e.

<span class="mw-page-title-main">Snub square tiling</span>

In geometry, the snub square tiling is a semiregular tiling of the Euclidean plane. There are three triangles and two squares on each vertex. Its Schläfli symbol is s{4,4}.

<span class="mw-page-title-main">Pentagonal tiling</span> A tiling of the plane by pentagons

In geometry, a pentagonal tiling is a tiling of the plane where each individual piece is in the shape of a pentagon.

In geometry, a uniform tiling is a tessellation of the plane by regular polygon faces with the restriction of being vertex-transitive.

<span class="mw-page-title-main">Anisohedral tiling</span> Tiling forced to use inequivalent tile placements

In geometry, a shape is said to be anisohedral if it admits a tiling, but no such tiling is isohedral (tile-transitive); that is, in any tiling by that shape there are two tiles that are not equivalent under any symmetry of the tiling. A tiling by an anisohedral tile is referred to as an anisohedral tiling.

<span class="mw-page-title-main">Apeirogonal antiprism</span> Antiprism with an infinite-sided polygon base

In geometry, an apeirogonal antiprism or infinite antiprism is the arithmetic limit of the family of antiprisms; it can be considered an infinite polyhedron or a tiling of the plane.

In geometry, a uniform honeycomb or uniform tessellation or infinite uniform polytope, is a vertex-transitive honeycomb made from uniform polytope facets. All of its vertices are identical and there is the same combination and arrangement of faces at each vertex. Its dimension can be clarified as n-honeycomb for an n-dimensional honeycomb.

<span class="mw-page-title-main">Penrose tiling</span> Non-periodic tiling of the plane

A Penrose tiling is an example of an aperiodic tiling. Here, a tiling is a covering of the plane by non-overlapping polygons or other shapes, and a tiling is aperiodic if it does not contain arbitrarily large periodic regions or patches. However, despite their lack of translational symmetry, Penrose tilings may have both reflection symmetry and fivefold rotational symmetry. Penrose tilings are named after mathematician and physicist Roger Penrose, who investigated them in the 1970s.

<span class="mw-page-title-main">Pythagorean tiling</span> Tiling by squares of two sizes

A Pythagorean tiling or two squares tessellation is a tiling of a Euclidean plane by squares of two different sizes, in which each square touches four squares of the other size on its four sides. Many proofs of the Pythagorean theorem are based on it, explaining its name. It is commonly used as a pattern for floor tiles. When used for this, it is also known as a hopscotch pattern or pinwheel pattern, but it should not be confused with the mathematical pinwheel tiling, an unrelated pattern.

<span class="mw-page-title-main">Aperiodic set of prototiles</span>

A set of prototiles is aperiodic if copies of the prototiles can be assembled to create tilings, such that all possible tessellation patterns are non-periodic. The aperiodicity referred to is a property of the particular set of prototiles; the various resulting tilings themselves are just non-periodic.

<span class="mw-page-title-main">Conway criterion</span> Rule from the theory of the tiling of the plane

In the mathematical theory of tessellations, the Conway criterion, named for the English mathematician John Horton Conway, is a sufficient rule for when a prototile will tile the plane. It consists of the following requirements: The tile must be a closed topological disk with six consecutive points A, B, C, D, E, and F on the boundary such that:

<span class="mw-page-title-main">Voderberg tiling</span>

The Voderberg tiling is a mathematical spiral tiling, invented in 1936 by mathematician Heinz Voderberg (1911-1945). Karl August Reinhardt asked the question of whether there is a tile such that two copies can completely enclose a third copy. Voderberg, his student, answered in the affirmative with Form eines Neunecks eine Lösung zu einem Problem von Reinhardt ["On a nonagon as a solution to a problem of Reinhardt"].

<span class="mw-page-title-main">Casey Mann</span> American mathematician

Casey Mann is an American mathematician, specializing in discrete and computational geometry, in particular tessellation and knot theory. He is Professor of Mathematics at University of Washington Bothell, and received the PhD at the University of Arkansas in 2001.

References

  1. Heesch (1968), as cited by Grünbaum & Shephard (1987) and Fontaine (1991).
  2. Dutch, Steven. "The Heesch Tile: An Interesting Non-Tiler". Natural and Applied Sciences, University of Wisconsin–Green Bay. Archived from the original on 2017-08-25. Retrieved 2008-12-22.
  3. Grünbaum & Shephard (1987 , pp. 155–156, Heesch's Problem)
  4. 1 2 3 Bašić, Bojan (2021). "A Figure with Heesch Number 6: Pushing a Two-Decade-Old Boundary". The Mathematical Intelligencer. 43 (3): 50–53. doi: 10.1007/s00283-020-10034-w . ISSN   0343-6993. PMC   7812982 . PMID   34934265.
  5. 1 2 3 4 5 6 7 Mann, Casey (2004). "Heesch's tiling problem" (PDF). American Mathematical Monthly . 111 (6): 509–517. doi:10.2307/4145069. JSTOR   4145069. MR   2076583..
  6. Grünbaum & Shephard (1987 , p. 151, 3.8.1 The Extension Theorem)
  7. Fontaine, Anne (1991). "An infinite number of plane figures with Heesch number two". Journal of Combinatorial Theory. Series A. 57 (1): 151–156. doi:10.1016/0097-3165(91)90013-7..
  8. Senechal, Marjorie (1995). Quasicrystals and Geometry. Vol. 111. Cambridge University Press. pp. 145–146..
  9. Тарасов, А. С. (2010). О числе Хееша для плоскости Лобачевского [On the Heesch number for the hyperbolic plane]. Matematicheskie Zametki (in Russian). 88 (1): 97–104. doi: 10.4213/mzm5251 . MR   2882166.. English translation in Math. Notes 88 (1–2): 97–102, 2010, doi : 10.1134/S0001434610070096.

Sources

Further reading