Forcing nonperiodic tilings with one tile using a seed
Reviewed by Pithpith:ZLJPHGTCopen to challenge →
classification
math.MG
math.CO
keywords
matchingtilingseinsteinforcingnonperiodiconlyproblemrules
read the original abstract
The so-called "einstein problem" (a pun playing with the famous scientist's name and the German term "ein Stein" for "one stone") asks for a simply connected prototile only allowing nonperiodic tilings without need of any matching rule. So far, researchers come only close to this demand by defining decorated prototiles forcing nonperiodicity of any generated tiling using matching rules. In this paper a class of spiral tilings (and one non-spiral example) is linked to a weaker form of the einstein problem where one or several seed tiles are used. Furthermore, the classical types of matching rules are listed and some new types are discussed.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.