The Domino Problem is Undecidable on Surface Groups
Keywords: decidability, tilings, substitutions, Domino problem, SFTs
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 isundecidable for the fundamental group of any closed orientable surface of genus at least 2.
Más información
| Editorial: | Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik |
| Fecha de publicación: | 2019 |
| Página de inicio: | 1 |
| Página final: | 14 |
| Idioma: | English |
| URL: | https://drops.dagstuhl.de/opus/volltexte/2019/10990/pdf/LIPIcs-MFCS-2019-46.pdf |