Domino Snake Problems on Groups

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationFundamentals of Computation Theory - 24th International Symposium, FCT 2023, Proceedings
EditorsHenning Fernau, Klaus Jansen
PublisherSpringer Science and Business Media Deutschland GmbH
Pages46-59
Number of pages14
ISBN (Print)9783031435867
DOIs
Publication statusPublished - 1 Jan 2023
Externally publishedYes
Event24th International Symposium on Fundamentals of Computation Theory, FCT 2023 - Trier, Germany
Duration: 18 Sept 202321 Sept 2023

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume14292 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference24th International Symposium on Fundamentals of Computation Theory, FCT 2023
Country/TerritoryGermany
CityTrier
Period18/09/2321/09/23

Keywords

  • Combinatorial Group Theory
  • Computability Theory
  • Domino Snake Problems
  • MSO logic
  • Symbolic Dynamics

Fingerprint

Dive into the research topics of 'Domino Snake Problems on Groups'. Together they form a unique fingerprint.

Cite this