Periodicity and decidability of tilings of Z2
Abstract
We prove that any finite set F⊂ Z2 that tiles Z2 by translations also admits a periodic tiling. As a consequence, the problem whether a given finite set F tiles Z2 is decidable.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.