Papers
Topics
Authors
Recent
Search
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.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.