REVIEW 6 cited by
An aperiodic monotile
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
A longstanding open problem asks for an aperiodic monotile, also known as an "einstein": a shape that admits tilings of the plane, but never periodic tilings. We answer this problem for topological disk tiles by exhibiting a continuum of combinatorially equivalent aperiodic polygons. We first show that a representative example, the "hat" polykite, can form clusters called "metatiles", for which substitution rules can be defined. Because the metatiles admit tilings of the plane, so too does the hat. We then prove that generic members of our continuum of polygons are aperiodic, through a new kind of geometric incommensurability argument. Separately, we give a combinatorial, computer-assisted proof that the hat must form hierarchical -- and hence aperiodic -- tilings.
Forward citations
Cited by 6 Pith papers
-
A $\sigma$-morphic convex protoset
A sigma-morphic protoset made entirely of convex polygons is constructed by replacing the bumps and nicks of a known non-convex example with angular convex notches.
-
Escher Tile Deformation via Closed-Form Solution
A closed-form deformation method lets users drag point handles on Escher tiles from all 17 wallpaper groups, updating both boundary and interior in real time while preserving tileability.
-
On the long-range order of the Spectre tilings
The Spectre tiling and all Spectre-like tilings have pure point diffraction and are MLD to reprojections of a cut-and-project model set, with the smallest possible first Čech cohomology.
-
Quantum error-correcting codes from aperiodic monotiles: the Hat and the Spectre
The Hat and Spectre aperiodic monotiles define erasure-correcting quantum codes with two local-indistinguishability sectors; under SE(2) the Hat retains a superselected chirality bit while the Spectre's label is gauged away.
-
Undecidability of Translational Tiling with Three Tiles
Deciding translational tiling of Z^4 by three connected polyhypercubes is undecidable, shown by reduction from Wang's domino problem.
-
Quasilattices of the Spectre monotile
Decorating every Spectre tile with the same point yields a wide variety of non-periodic quasilattices, including sparse, clustered, and near-hexagonal examples.
Discussion (0). Continue with ORCID to comment.