Graph Subshifts - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

Graph Subshifts

Abstract

We propose a definition of graph subshifts of finite type that can be seen as extending both the notions of subshifts of finite type from classical symbolic dynamics and finitely presented groups from combinatorial group theory. These are sets of graphs that are defined by forbidding finitely many local patterns. In this paper, we focus on the question whether such local conditions can enforce a specific support graph, and thus relate the model to classical symbolic dynamics. We prove that the subshifts that contain only infinite graphs are either aperiodic, or feature no residual finiteness of their period group, yielding non-trivial examples as well as two natural undecidability theorems.
Fichier principal
Vignette du fichier
2302.07249.pdf (437.59 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04310695 , version 1 (07-02-2024)

Identifiers

Cite

Pablo Arrighi, Amélia Durbec, Pierre Guillon. Graph Subshifts. CiE 2023 - 19th Conference on Computability in Europe, Jul 2023, Batumi, Georgia. pp.261-274, ⟨10.1007/978-3-031-36978-0_21⟩. ⟨hal-04310695⟩
49 View
16 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More