Sturmian lattices and Aperiodic tile sets
Shigeki Akiyama, Tadahisa Hamada, Katsuki Ito
TL;DR
The paper presents an explicit algorithm to construct aperiodic tile sets from Sturmian words with quadratic slopes, using Sturmian lattices and BD equivalence as the central toolset. For any quadratic irrational slope $\alpha$, the expansion constant $\lambda$ is a unit in the real quadratic field $\mathbb{Q}(\alpha)$, yielding self-similar Sturmian lattices and infinitely many essentially different aperiodic tile sets realized via cross BD correspondences. A key geometric principle is that a quadratic curve and a line intersect in at most two points, which underpins the aperiodicity proof, while cabinet cells and Ammann bars encode the Sturmian structure in a tile-combinatorial framework. The authors provide bounds on tile counts in terms of expansion data, develop a practical construction workflow, and illustrate several explicit examples (including recoveries of Smith Turtle), suggesting a pathway to aperiodic monotiles guided by Sturmian dynamics.
Abstract
We give an explicit algorithm to construct aperiodic tile sets based on Sturmian words of quadratic slopes. The method works for any quadratic irrational slope, and we can produce infinitely many aperiodic tile sets whose underlying scaling constant is a unit of any real quadratic field. There are two key ingredients in our construction. The first one is ``Sturmian lattices''; an interesting grid structure generated by Sturmian words that emerged in an aperiodic monotile called Smith Turtle. We shall give a classification of Sturmian lattices. The second is the bounded displacement equivalence of Delone sets, which plays a central role in this construction.
