DeepAI AI Chat
Log In Sign Up

Graph subshifts

02/14/2023
by   Pablo Arrighi, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

06/02/2022

Recognizing the Commuting Graph of a Finite Group

In this paper we study the realizability question for commuting graphs o...
12/28/2020

Automorphism groups of graphs of bounded Hadwiger number

We determine the structure of automorphism groups of finite graphs of bo...
10/03/2021

The isomorphism problem for plain groups is in Σ_3^𝖯

Testing isomorphism of infinite groups is a classical topic, but from th...
11/19/2019

A topological dynamical system with two different positive sofic entropies

A sofic approximation to a countable group is a sequence of partial acti...
04/26/2022

Twin-width VII: groups

Twin-width is a recently introduced graph parameter with applications in...
12/18/2018

Qualitative graph limit theory. Cantor Dynamical Systems and Constant-Time Distributed Algorithms

The goal of the paper is to lay the foundation for the qualitative analo...
12/14/2022

Unfoldings and coverings of weighted graphs

Coverings of undirected graphs are used in distributed computing, and un...