2000 character limit reached
Tiling Problems on Baumslag-Solitar groups
Published 5 Sep 2013 in cs.DM and math.CO | (1309.1266v1)
Abstract: We exhibit a weakly aperiodic tile set for Baumslag-Solitar groups, and prove that the domino problem is undecidable on these groups. A consequence of our construction is the existence of an arecursive tile set on Baumslag-Solitar groups.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.