Abstract
In [1] we construct aperiodic tile sets on the Baumslag-Solitar groups BS(m,n). Aperiodicity plays a central role in the undecidability of the classical domino problem on Z2, and analogously to this we state as a corollary of the main construction that the Domino problem is undecidable on all Baumslag-Solitar groups. In the present work we elaborate on the claim and provide a full proof of this fact. We also provide details of another result reported in [1]: there are tiles that tile the Baumslag-Solitar group BS(m,n) but none of the valid tilings is recursive. The proofs are based on simulating piecewise affine functions by tiles on BS(m,n).
| Original language | English |
|---|---|
| Pages (from-to) | 12-22 |
| Number of pages | 11 |
| Journal | Theoretical Computer Science |
| Volume | 894 |
| DOIs | |
| Publication status | Published - 26 Nov 2021 |
| Externally published | Yes |
Keywords
- Baumslag-Solitar group
- Domino problem
- Tiling
- Undecidability