Periodicity and decidability of tilings of Z^2
From MaRDI portal
Publication:5218129
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.
Recommendations
Cited in
(32)- Homogeneous subsets of Z^2 and plane tilings
- The countability of a tiling family and the periodicity of a tiling
- Spectral sets and tiles in \(\mathbb{Z}_p^2 \times \mathbb{Z}_q^2\)
- The Coven-Meyerowitz tiling conditions for 3 odd prime factors
- Tiling \(\mathbb{Z}^{2}\) by a set of four elements
- Combinatorial and harmonic-analytic methods for integer tilings
- Periodicity of one-dimensional tilings
- Periodic structure of translational multi-tilings in the plane
- The structure of translational tilings in \(\mathbb{Z}^d\)
- Tiling \(\mathbb Z^2\) with translations of one set
- On identification in \(\mathbb Z^2\) using translates of given patterns
- Solution to a conjecture of Schmidt and Tuller on one-dimensional packings and coverings
- Expansivity and periodicity in algebraic subshifts
- On rationality of spectrums for spectral sets in \(\mathbb{R} \)
- Undecidable translational tilings with only two tiles, or one nonabelian tile
- On forced periodicity of perfect colorings
- Max-norm Ramsey theory
- Universal spectra in \(G\times\mathbb{Z}_p\)
- Tilings of \(\mathbb{Z}\) with multisets of distances
- A Fuglede type conjecture for discrete Gabor bases
- An aperiodic monotile
- Periodicity and decidability of translational tilings by rational polygonal sets
- Aperiodic monotiles: from geometry to groups
- Tilings, sub-tilings, and spectral sets on p-adic space
- Splitting for integer tilings
- Undecidability of translational tiling of the 4-dimensional space with a set of 4 polyhypercubes
- A note on reduction of tiling problems
- The Coven-Meyerowitz tiling conditions for three prime factors: the even case
- Undecidability of translational tiling of the 3-dimensional space with a set of 6 polycubes
- A counterexample to the periodic tiling conjecture
- On low complexity colorings of grids (invited talk)
- Tiling with three polygons is undecidable
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)