Periodicity and decidability of tilings of $\mathbb{Z}^{2}$
Combinatorics
2016-02-19 v1 Dynamical Systems
Abstract
We prove that any finite set that tiles by translations also admits a periodic tiling. As a consequence, the problem whether a given finite set tiles is decidable.
Cite
@article{arxiv.1602.05738,
title = {Periodicity and decidability of tilings of $\mathbb{Z}^{2}$},
author = {Siddhartha Bhattacharya},
journal= {arXiv preprint arXiv:1602.05738},
year = {2016}
}