Translational tilings by axis-parallel polygonal sets

Source abstract

The periodic tiling conjecture asserts that if a bounded set $Ω\subset \mathbb R^d$ of finite measure tiles $\mathbb R^d$ by translations, then it admits at least one fully periodic tiling. This conjecture was proved to hold in $\mathbb R$ by Lagarias and Wang, and was recently disproved by Greenfeld and Tao in sufficiently high dimensions. Its discrete analogue in $\mathbb Z^2$ was proved by Bhattacharya, whereas the conjecture in $\mathbb R^2$ remains open. In this paper, we analyze the structure of tilings by axis-parallel polygonal sets: bounded open sets in $\mathbb R^2$ whose boundary is a finite union of line segments parallel to the axes. We prove that every such tiling that is topologically minimal is weakly periodic. Moreover, we show that if an axis-parallel polygonal set $Ω$ tiles $\mathbb{R}^2$ then it admits a quasi-periodic tiling (i.e., a finite union of translated lattices). The proofs combine geometric decompositions of tilings with rational approximation and discrete tiling theory. As a consequence, we obtain that the translational tiling problem for axis-parallel polygonal sets with real algebraic vertex coordinates is decidable.