Periodicity and decidability of tilings of mathbb{Z}²
classification
🧮 math.CO
math.DS
keywords
mathbbfinitetilesadmitsconsequencedecidabilitydecidablegiven
read the original abstract
We prove that any finite set $F\subset {\mathbb{Z}^2}$ that tiles ${\mathbb{Z}^2}$ by translations also admits a periodic tiling. As a consequence, the problem whether a given finite set $F$ tiles ${\mathbb{Z}^2}$ is decidable.
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.