2000 character limit reached
Aperiodic tilings with one prototile and low complexity atlas matching rules
Published 25 Mar 2010 in math.CO | (1003.4909v1)
Abstract: We give a constructive method that can decrease the number of prototiles needed to tile a space. We achieve this by exchanging edge to edge matching rules for a small atlas of permitted patches. This method is illustrated with Wang tiles, and we apply our method to present via these rules a single prototile that can only tile $R3$ aperiodically, and a pair of square tiles that can only tile $R2$ aperiodically.
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.