Graph Subshifts - Archive ouverte HAL
Conference Papers Year : 2021

Graph Subshifts

Abstract

We propose a definition of graph subshifts of finite type that extends the power of both subshifts of finite type from classical symbolic dynamics and finitely presented groups from combinatorial group theory. These are sets of (finite or infinite) graphs that are defined by forbidding finitely many local patterns. The definition makes it not obvious to forbid finite graphs, but we prove that some nontrivial subshifts actually contain only infinite graphs: these are built either by forcing aperiodicity (such as in classical constructions of subshifts of finite type on the grid), or no residual finiteness of the period group.
Fichier principal
Vignette du fichier
GraphTilings_exploratory.pdf (368.87 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03238087 , version 1 (26-05-2021)
hal-03238087 , version 2 (19-06-2021)
hal-03238087 , version 3 (17-02-2023)

Identifiers

  • HAL Id : hal-03238087 , version 2

Cite

Amélia Durbec. Graph Subshifts. 27th International Workshop on Cellular Automata and Discrete Complex Systems, Jul 2021, Marseille, France. ⟨hal-03238087v2⟩
306 View
141 Download

Share

More