09-25-2026, 01:44 PM
“An aperiodic monotile” by David Smith, Joseph Samuel Myers, Craig S. Kaplan, and Chaim Goodman-Strauss addresses a famous problem in tiling theory: whether there exists a single tile that can cover the entire plane, but only in non-periodic ways. Such a tile is called an aperiodic monotile, or informally an Einstein—from the German ein Stein, “one stone.” The paper presents a solution using a family of polygonal tiles, with the best-known representative being the “hat”. The current version is v3, revised in July 2024.
The central construction begins with the hat tile, a polygon assembled from eight kites. The authors show that hats can combine into larger structures called metatiles. These metatiles themselves obey substitution rules: a large-scale copy can be decomposed into smaller copies according to a fixed hierarchical pattern. Because these substitution structures can tile the entire plane, the authors establish that the hat itself can tile the plane. In symbolic form, the basic idea is a substitution hierarchy such as $T \rightarrow {T_1,T_2,\ldots,T_n}$, where increasingly large configurations are recursively constructed from smaller ones.
The much harder part is proving aperiodicity. A tiling is periodic if there exists a nonzero translation vector $v$ such that translating the entire tiling by $v$ leaves it unchanged. The authors demonstrate that the hat cannot admit such a periodic arrangement. Their argument combines geometric ideas with incommensurability: the geometric parameters of generic members of the tile family prevent the structures from repeating through a common translation period. They also provide a separate computer-assisted combinatorial proof showing that every hat tiling must possess a hierarchical structure. This hierarchy forces increasingly large-scale organization and therefore rules out periodicity.
An especially important result is that the hat is not an isolated curiosity. The authors construct a continuum of combinatorially equivalent aperiodic polygons. In other words, there is a continuous family of geometrically different shapes that share the same essential combinatorial structure and retain the aperiodic property for generic parameter choices. The work therefore does more than identify one exotic shape: it develops a framework connecting combinatorics, geometry, substitution systems, and tiling theory. The result resolves the long-standing monotile problem for topological-disk tiles and provides new mathematical tools for understanding how local geometric constraints can force global non-periodic order.
Key takeaways
Read the full paper on arXiv
The central construction begins with the hat tile, a polygon assembled from eight kites. The authors show that hats can combine into larger structures called metatiles. These metatiles themselves obey substitution rules: a large-scale copy can be decomposed into smaller copies according to a fixed hierarchical pattern. Because these substitution structures can tile the entire plane, the authors establish that the hat itself can tile the plane. In symbolic form, the basic idea is a substitution hierarchy such as $T \rightarrow {T_1,T_2,\ldots,T_n}$, where increasingly large configurations are recursively constructed from smaller ones.
The much harder part is proving aperiodicity. A tiling is periodic if there exists a nonzero translation vector $v$ such that translating the entire tiling by $v$ leaves it unchanged. The authors demonstrate that the hat cannot admit such a periodic arrangement. Their argument combines geometric ideas with incommensurability: the geometric parameters of generic members of the tile family prevent the structures from repeating through a common translation period. They also provide a separate computer-assisted combinatorial proof showing that every hat tiling must possess a hierarchical structure. This hierarchy forces increasingly large-scale organization and therefore rules out periodicity.
An especially important result is that the hat is not an isolated curiosity. The authors construct a continuum of combinatorially equivalent aperiodic polygons. In other words, there is a continuous family of geometrically different shapes that share the same essential combinatorial structure and retain the aperiodic property for generic parameter choices. The work therefore does more than identify one exotic shape: it develops a framework connecting combinatorics, geometry, substitution systems, and tiling theory. The result resolves the long-standing monotile problem for topological-disk tiles and provides new mathematical tools for understanding how local geometric constraints can force global non-periodic order.
Key takeaways
- The problem: Find one tile that tiles the plane but never periodically.
- The solution: The authors exhibit the Hat, an aperiodic monotile.
- Tiling: The Hat can cover the plane without gaps or overlaps.
- Aperiodicity: No Hat tiling can possess a translational period $v\neq0$.
- Hierarchical structure: Hat tiles organize into larger metatiles, which recursively organize into still larger structures.
- Substitution: The construction can be represented schematically by recursive rules such as $T\mapsto{T_1,\ldots,T_n}$.
- Geometric argument: Incommensurability prevents the relevant structures from repeating periodically.
- Computer-assisted proof: A finite combinatorial analysis verifies constraints that force hierarchical, and hence aperiodic, tilings.
- Broader result: There is a continuum of geometrically distinct aperiodic polygons, not merely one special tile.
- Mathematical significance: The paper connects discrete geometry, combinatorics, tilings, substitution systems, and computational proof.
- Educational connection: It provides an excellent example of how simple local rules can impose highly nontrivial global behavior—a useful theme for teaching symmetry, recursion, transformations, geometry, and mathematical proof.
Read the full paper on arXiv
┌────────────────────────────────┐
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘