English

A note on reduction of tiling problems

Combinatorics 2022-11-15 v1 Logic

Abstract

We show that translational tiling problems in a quotient of Zd\mathbb{Z}^d can be effectively reduced or ``simulated'' by translational tiling problems in Zd\mathbb{Z}^d. In particular, for any dNd \in \mathbb{N}, k<dk < d and N1,,NkNN_1,\ldots,N_k \in \mathbb{N} the existence of an aperiodic tile in Zdk×(Z/N1Z××Z/NkZ)\mathbb{Z}^{d-k} \times (\mathbb{Z} / N_1\mathbb{Z} \times \ldots \times \mathbb{Z} / N_k \mathbb{Z}) implies the existence of an aperiodic tile in Zd\mathbb{Z}^d. Greenfeld and Tao have recently disproved the well-known periodic tiling conjecture in Zd\mathbb{Z}^d for sufficiently large dNd \in \mathbb{N} by constructing an aperiodic tile in Zdk×(Z/N1Z××Z/NkZ)\mathbb{Z}^{d-k} \times (\mathbb{Z} / N_1\mathbb{Z} \times \ldots \times \mathbb{Z} / N_k \mathbb{Z}) for suitable d,N1,,NkNd,N_1,\ldots,N_k \in \mathbb{N}.

Keywords

Cite

@article{arxiv.2211.07140,
  title  = {A note on reduction of tiling problems},
  author = {Tom Meyerovitch and Shrey Sanadhya and Yaar Solomon},
  journal= {arXiv preprint arXiv:2211.07140},
  year   = {2022}
}

Comments

10 pages, 4 figures

R2 v1 2026-06-28T05:46:45.763Z