AI Chat AI Image Generator AI Video Text to Speech

The domino problem is undecidable on surface groups

11/20/2018

∙

by Nathalie Aubrun, et al.

∙

∙

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.

Nathalie Aubrun
5 publications
Sebastián Barbieri
2 publications
Etienne Moutot
6 publications

research

∙ 02/25/2020

The firefighter problem on polynomial and intermediate growth groups

We prove that any Cayley graph G with degree d polynomial growth does no...

0 Gideon Amir, et al. ∙

research

∙ 08/17/2019

The stable set problem in graphs with bounded genus and bounded odd cycle packing number

Consider the family of graphs without k node-disjoint odd cycles, where ...

0 Michele Conforti, et al. ∙

research

∙ 10/17/2022

A Category of Surface-Embedded Graphs

We introduce a categorical formalism for rewriting surface-embedded grap...

0 Malin Altenmüller, et al. ∙

research

∙ 11/12/2021

High Spots for the Ice-Fishing Problem with Surface Tension

In the ice-fishing problem, a half-space of fluid lies below an infinite...

0 Nathan Willis, et al. ∙

research

∙ 03/28/2023

Universal Coating in the 3D Hybrid Model

Motivated by the prospect of nano-robots that assist human physiological...

0 Irina Kostitsyna, et al. ∙

research

∙ 10/01/2022

Closed cap condition under the cap construction algorithm

Every polygon P can be companioned by a cap polygon P̂ such that P and P...

0 Mercedes Sandu, et al. ∙

research

∙ 08/04/2020

Automorphism groups of maps in linear time

By a map we mean a 2-cell decomposition of a closed compact surface, i.e...

0 Ken-ichi Kawarabayashi, et al. ∙