Domino Snake Problems on Groups

07/24/2023
by   Nathalie Aubrun, et al.
0

In this article we study domino snake problems on finitely generated groups. We provide general properties of these problems and introduce new tools for their study. The first is the use of symbolic dynamics to understand the set of all possible snakes. Using this approach we solve many variations of the infinite snake problem including the geodesic snake problem for certain classes of groups. Next, we introduce a notion of embedding that allows us to reduce the decidability of snake problems from one group to another. This notion enable us to establish the undecidability of the infinite snake and ouroboros problems on nilpotent groups for any generating set, given that we add a well-chosen element. Finally, we make use of monadic second order logic to prove that domino snake problems are decidable on virtually free groups for all generating sets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/11/2019

The word problem of the Brin-Thompson groups is coNP-complete

We prove that the word problem of the Brin-Thompson group nV over a fini...
research
01/26/2021

Products in a Category with Only One Object

We consider certain decision problems for the free model of the theory o...
research
03/27/2019

Generic properties in some classes of automaton groups

We prove, for various important classes of Mealy automata, that almost a...
research
11/29/2017

Bayesian analysis of finite population sampling in multivariate co-exchangeable structures with separable covariance matric

We explore the effect of finite population sampling in design problems w...
research
01/11/2020

Prediction with eventual almost sure guarantees

We study the problem of predicting the properties of a probabilistic mod...
research
04/25/2023

Semigroup algorithmic problems in metabelian groups

We consider semigroup algorithmic problems in finitely generated metabel...
research
10/20/2020

Algebraic Structures from Concurrent Constraint Programming Calculi for Distributed Information in Multi-Agent Systems

Spatial constraint systems (scs) are semantic structures for reasoning a...

Please sign up or login with your details

Forgot password? Click here to reset