Canonical projection tilings defined by patterns

Abstract

We give a necessary and sufficient condition on a $d$-dimensional affine subspace of ${\mathbb{R}}^n$ to be characterized by a finite set of patterns which are forbidden to appear in its digitization. This can also be stated in terms of local rules for canonical projection tilings, or subshift of finite type. This provides a link between algebraic properties of affine subspaces and combinatorics of their digitizations. The condition relies on the notion of {\em coincidence} and can be effectively checked. As a corollary, we get that only algebraic subspaces can be characterized by patterns.

24 pages, 12 figures

References in corpus (5)

• Gaps problems and frequencies of patches in cut and project sets
• When periodicities enforce aperiodicity
• No Weak Local Rules for the 4p-Fold Tilings
• Weak local rules for planar octagonal tilings
• Weak colored local rules for planar tilings

Cited by in corpus (2)

• Markov partitions for toral ${\mathbb{Z}}^2$-rotations featuring Jeandel-Rao Wang shift and model sets
• Ammann Bars for Octagonal Tilings