On the domino problem of the Baumslag-Solitar groups

THEORETICAL COMPUTER SCIENCE(2021)

引用 4|浏览5
暂无评分
摘要
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 Z(2), 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). (C) 2021 The Author(s). Published by Elsevier B.V.
更多
查看译文
关键词
Domino problem, Tiling, Undecidability, Baumslag-Solitar group
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要