Undecidable Translational Tilings with Only Two Tiles, or One Nonabelian Tile

We construct an example of a group $$G = \mathbb {Z}^2 \times G_0$$G=Z2×G0 for a finite abelian group $$G_0$$G0 , a subsetEof $$G_0$$G0 , and two finite subsets $$F_1,F_2$$F1,F2 of G, such that it is undecidable in ZFC whether $$\mathbb {Z}^2\times E$$Z2×E can be tiled by translations of $$F_1,F_2$$F1,F2 . In particular, this implies that this tiling problem isaperiodic, in the sense that (in the standard universe of ZFC) there exist translational tilings ofEby the tiles $$F_1,F_2$$F1,F2 , 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$$Z2 ). A similar construction also applies for $$G=\mathbb {Z}^d$$G=Zd for sufficiently large d. If one allows the group $$G_0$$G0 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.