2000 character limit reached
Canonical projection tilings defined by patterns
Published 17 Dec 2018 in math.DS, cs.DM, math.CO, and math.MG | (1812.06863v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.