Abstract
AbstractWe construct an example of a group $$G = \mathbb {Z}^2 \times G_0$$
G
=
Z
2
×
G
0
for a finite abelian group $$G_0$$
G
0
, a subset E of $$G_0$$
G
0
, and two finite subsets $$F_1,F_2$$
F
1
,
F
2
of G, such that it is undecidable in ZFC whether $$\mathbb {Z}^2\times E$$
Z
2
×
E
can be tiled by translations of $$F_1,F_2$$
F
1
,
F
2
. In particular, this implies that this tiling problem is aperiodic, in the sense that (in the standard universe of ZFC) there exist translational tilings of E by the tiles $$F_1,F_2$$
F
1
,
F
2
, but no periodic tilings. Previously, such aperiodic or undecidable translational tilings were only constructed for sets of eleven or more tiles (mostly in $$\mathbb {Z}^2$$
Z
2
). A similar construction also applies for $$G=\mathbb {Z}^d$$
G
=
Z
d
for sufficiently large d. If one allows the group $$G_0$$
G
0
to be non-abelian, a variant of the construction produces an undecidable translational tiling with only one tile F. The argument proceeds by first observing that a single tiling equation is able to encode an arbitrary system of tiling equations, which in turn can encode an arbitrary system of certain functional equations once one has two or more tiles. In particular, one can use two tiles to encode tiling problems for an arbitrary number of tiles.
Funder
Directorate for Mathematical and Physical Sciences
Simons Foundation
Eric and Wendy Schmidt Postdoctoral Award
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference36 articles.
1. Amman, R., Grünbaum, B., Shephard, G.C.: Aperiodic tiles. Discrete Comput. Geom. 8(1), 1–25 (1992)
2. Beauquier, D., Nivat, M.: On translating one polyomino to tile the plane. Discrete Comput. Geom. 6(6), 575–592 (1991)
3. Berger, R.: The Undecidability of the Domino Problem. PhD thesis, Harvard University (1964)
4. Berger, R.: The Undecidability of the Domino Problem. Memoirs of the American Mathematical Society, vol. 66. American Mathematical Society, Providence (1966)
5. Bhattacharya, S.: Periodicity and decidability of tilings of $${\mathbb{Z}} ^2$$. Am. J. Math. 142(1), 255–266 (2020)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Cube Tilings with Linear Constraints;Results in Mathematics;2024-07-27
2. A counterexample to the periodic tiling conjecture;Annals of Mathematics;2024-07-01
3. Max-norm Ramsey theory;European Journal of Combinatorics;2024-05