2000 character limit reached
The domino problem is undecidable on surface groups (1811.08420v1)
Published 20 Nov 2018 in math.GR, cs.DM, and math.DS
Abstract: We show that the domino problem is undecidable on orbit graphs of non-deterministic substitutions which satisfy a technical property. As an application, we prove that the domino problem is undecidable for the fundamental group of any closed orientable surface of genus at least 2.