Periodicity and decidability of tilings of Z^2

From MaRDI portal
Publication:5218129




Abstract: We prove that any finite set FsubsetmathbbZ2 that tiles mathbbZ2 by translations also admits a periodic tiling. As a consequence, the problem whether a given finite set F tiles mathbbZ2 is decidable.









This page was built for publication: Periodicity and decidability of tilings of \(\mathbb{Z}^2\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5218129)