🔢 mathematics

Matching Rules for a Three-Dimensional Strongly Aperiodic Monotile

This paper establishes minimal geometric matching rules, utilizing either colored arrows or colored squares, to enforce the three-dimensional "Chair" monotile to form a strongly aperiodic tiling by uniquely composing into larger "Superchairs," thereby facilitating the search for physical realizations of such structures.

Original authors: Felix Flicker

Published 2026-09-22

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Felix Flicker

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the vast landscape of geometry, there is a special class of shapes known as tiles. These are pieces that can be fitted together to cover a surface or fill a space without leaving any gaps or overlapping. For centuries, mathematicians have been fascinated by the rules that govern how these shapes can be arranged. Some shapes, like squares or hexagons, can be laid out in a perfectly repeating pattern that stretches on forever in every direction. Others, however, can only be arranged in a way that never repeats itself. This property is called aperiodicity. While it was long known that aperiodic patterns could be created using a large set of different shapes, the ultimate challenge was to find a single shape, a "monotile," that could force such a non-repeating pattern on its own. In 2023, this puzzle was solved for flat, two-dimensional surfaces, revealing a shape that could only tile a plane in a non-repeating way. This discovery sparked a new question: does such a shape exist in the three-dimensional world we live in?

The search for a three-dimensional solution led researchers to a shape known as the "Chair." This tile is constructed from seven unit cubes arranged to form a block with one corner missing, resembling a simple chair. While this shape can be arranged to form a repeating pattern, it is also capable of forming a complex, non-repeating structure. The challenge was to find a way to modify the Chair so that it could only form the non-repeating pattern, effectively forbidding the repeating one. A recent breakthrough used artificial intelligence to identify a specific set of geometric decorations on the faces of the Chair that achieved this. However, the rules required by that initial discovery were intricate, involving precise pyramids and recesses of specific heights, which made them difficult to build in the real world.

A new study by Felix Flicker from the University of Bristol takes this discovery a step further by asking a fundamental question: what is the absolute minimum amount of decoration needed to force the Chair to behave this way? The goal was to strip away the complex geometry and find the simplest possible rules that still guarantee the non-repeating pattern. The researcher found that the requirements are surprisingly minimal. Instead of relying on complex 3D shapes, the same result can be achieved using simple markings: arrows or even just colors on the faces of the cubes.

The study begins by verifying the logic behind the original discovery. The proof relies on a process of building up the structure layer by layer. When the decorated Chair tiles are placed together, they are forced to group into larger clusters of eight, which the researchers call "Superchairs." These Superchairs are essentially the same shape as the original Chair but twice as large. Crucially, the rules ensure that these Superchairs must then group together to form even larger "Super-Superchairs," and so on, creating an infinite hierarchy of ever-larger structures. Because this pattern of doubling in size can continue forever, the structure can never settle into a repeating loop. If you tried to shift the entire pattern to make it overlap with itself, the mismatch in scale would prevent it from ever aligning perfectly. This mathematical structure proves that the tiling is "strongly aperiodic," meaning it has no repeating symmetry at all.

Flicker's work demonstrates that the complex pyramids and recesses used in the original AI-generated proof are not strictly necessary. By replacing them with simple arrows on the faces of the cubes, the same hierarchical structure is enforced. The rules for these arrows are straightforward: arrows must align with each other, and specific colors must meet specific other colors. For instance, a black arrow might only be allowed to touch a white one, while a blue arrow must touch another blue one. When the researcher ran computer simulations to test these rules, they found that even with these simple markings, the tiles could only form the valid, non-repeating clusters. The simulations showed that out of thousands of possible ways the tiles could touch, only a tiny fraction were allowed, and all of those led to the same unique, non-repeating structure.

Even more surprisingly, the study found that the orientation of the arrows was not even required. The researchers tested a version where the arrows were replaced entirely by solid colors on the square faces. In this scenario, a black square could only touch a white square, and a grey square could only touch another grey square, regardless of how the tiles were rotated. The computer enumeration revealed that while this simpler rule allowed for more initial combinations of tiles, it still ultimately forced the same result. The "mirror image" versions of the tiles that appeared in the early stages of these combinations were eventually ruled out as the structure grew larger. Only the original, non-mirrored arrangement could sustain the infinite layers required to fill space. This means that the tiling can be forced using nothing more than a simple color code on the faces of the cubes.

The implications of this simplification are significant for the physical world. Because the rules are so basic, they could be implemented using real materials. The researcher suggests that this could be achieved using colloids, which are tiny particles suspended in a fluid, where the particles have bumps and dents that match the color or shape rules. It might also be possible to create these patterns using DNA self-assembly or by arranging atoms in optical lattices, which are grids of light used to trap atoms. The study provides concrete examples of how these rules could be physically encoded, such as using hemispherical bumps of different sizes on black and white squares, or flat grey squares.

The discovery also connects to the broader understanding of how matter can be structured. Unlike the quasicrystals found in nature, which rely on complex mathematical ratios involving irrational numbers, this Chair tiling is built on a "limit-periodic" structure. This means it is constructed from a repeating pattern that doubles in size at each step, a process that does not require any irrational numbers to define. This distinction is important because it suggests that the physical properties of materials built on this tiling would be different from those of quasicrystals. For instance, the way light or electrons would scatter off such a structure would produce a unique pattern of sharp peaks, offering a clear experimental signature for scientists to look for.

By reducing the rules to their bare essentials, this research opens the door to exploring these three-dimensional structures in the laboratory. The work confirms that the strange, non-repeating order of the Chair tiling is not a fragile mathematical curiosity dependent on complex geometry, but a robust property that can be enforced by the simplest of constraints. Whether through the alignment of arrows or the matching of colors, the universe of this single shape is locked into a pattern that never repeats, offering a new playground for physicists and material scientists to explore the boundaries of order and disorder in three dimensions.

Technical Summary: Matching Rules for a Three-Dimensional Strongly Aperiodic Monotile

Problem Statement
The paper addresses the existence and construction of a three-dimensional (3D) strongly aperiodic monotile. While 2D aperiodic monotiles (such as the "Hat" and "Spectre") were discovered recently, the 3D case remains distinct due to the classification of aperiodicity. A monotile is weakly aperiodic if it admits a tiling with an infinite-order symmetry group (e.g., a screw axis or periodic stacking of non-periodic layers), as seen in the Schmitt–Conway–Danzer biprism and the Socolar–Taylor tile. A monotile is strongly aperiodic only if it admits no symmetries of infinite order. Although a recent pre-print [1] proposed a 3D strongly aperiodic monotile (the "Decorated Chair") using geometric face decorations, the specific constraints required to enforce this property were not fully generalized. The author seeks to determine the minimal necessary conditions for these decorations to facilitate the search for physical realizations.

Methodology
The author builds upon the "Decorated Chair" identified in Ref. [1], which is based on the 3D Chair tile (a $2 \times 2 \times 2$ block of unit cubes with one corner removed). The original proof in Ref. [1] relied on exhaustive enumeration of tile interactions:

Enumerating all ways a Decorated Chair can meet translated, rotated, or mirrored copies (44 valid configurations).
Enumerating all ways to enclose a central Chair in a single shell (33 clusters).
Enumerating the addition of a second shell, revealing that the central Chair can only exist within a specific 8-Chair cluster called the "Decorated Superchair."

The author replicates and extends this methodology using computational enumeration to test simplified matching rules. They utilize a custom code (written with AI assistance) to enumerate tile interactions and shell formations. They test two alternative decoration schemes:

Arrow Rules: Using three colors of arrows (black, white, blue) on square faces with specific alignment constraints (black-to-white, blue-to-blue, and edge/diagonal alignment).
Face-Color Rules: Removing orientational constraints entirely, relying solely on the color of the square faces (black, white, grey) with matching rules (black meets white; grey meets grey).

Key Contributions and Results

Validation of the Original Proof: The author independently verified the finite enumerations from Ref. [1], confirming that the geometric decorations force the formation of "Superchairs" (clusters of 8 Chairs with doubled linear dimensions) and that these Superchairs obey the same matching rules as the individual Chairs. This recursive structure proves strong aperiodicity, as any translational symmetry vector $v$ would imply the existence of $2^n v$ for all $n$ , which is only possible if $v=0$ .
Simplification via Arrow Rules: The author demonstrates that the complex geometric pyramids of Ref. [1] can be replaced by a simpler set of three colored arrows. While not equivalent to the original rules (which have more than three inequivalent decorations), these arrow rules reduce the 2,388 possible ways two Chairs can meet down to the same 44 valid configurations found in the original proof. The enumeration confirms that these rules also force the unique formation of the Decorated Superchair and the subsequent infinite hierarchy.
Minimization via Face-Color Rules: The author further relaxes the constraints by removing orientational requirements, using only face colors (black, white, grey). Under these rules, the number of ways two Chairs can meet increases to 611 (including mirrored configurations). However, when enumerating second-layer shells, the author finds that configurations involving mirrored Chairs are illegitimate and cannot form a complete second shell. Consequently, only the original 15 valid single-layer shells (which form the unique Superchair) survive. This proves that face colors alone are sufficient to force the strongly aperiodic tiling, regardless of orientation.
Physical Realization Proposals: The paper provides simple geometric examples of how these minimal rules could be physically encoded, such as hemispherical bumps and indents on black and white squares, or flat grey squares. The author suggests that systems like lock-and-key colloids, cubic colloids, DNA self-assembly, and interacting cold atoms in optical lattices could potentially realize this tiling.

Significance
The paper's primary significance lies in establishing that the constraints required to enforce a 3D strongly aperiodic monotiling are minimal. By demonstrating that complex geometric features can be reduced to simple arrow alignments or even just face colors, the author lowers the barrier for experimental realization. The work suggests that the "Chair Tiling" is not merely a mathematical curiosity but a structure that could be manifested in physical systems, such as colloidal assemblies or quantum simulators. Furthermore, the author notes that the Chair Tiling is "limit periodic" (constructed via cut-and-project with a 2-adic internal space) rather than a Pisot-type substitution tiling, distinguishing its diffraction properties (sharp Bragg peaks) from quasicrystals. The identification of simple matching rules facilitates the study of physical properties on this tiling, such as the localization of wavefunctions or the formation of glassy states, analogous to studies on 2D aperiodic tilings.

Technical Summary: Matching Rules for a Three-Dimensional Strongly Aperiodic Monotile

More like this