Unindexed subshifts of finite type and their connection to automorphisms of Thompson's groups
Luke Elliott

TL;DR
This paper introduces a new categorical framework generalizing subshifts of finite type, defining UDAF and weak UDAF equivalences, and connects these to automorphism groups of Higman, Thompson, and Brin groups.
Contribution
It proposes a novel category extending subshifts of finite type, introduces two new equivalence notions, and links these to automorphism groups of important algebraic structures.
Findings
UDAF equivalence does not imply shift equivalence.
UDAF equivalence equates the 2-leaf rose with the golden mean shift.
The category relates to automorphism groups of Higman, Thompson, and Brin groups.
Abstract
For a finite digraph , we define the corresponding subshift of finite type to be the dynamical system where is the set of all bi-infinite walks through and is the shift operator. Two digraphs and are called shift equivalent if there is such that and are topologically conjugate for all . They are called strong shift equivalent if this holds for . In this paper we introduce a new category which generalises the category of subshifts of finite type and topological conjugacy. Our category gives two new notions of equivalence for digraphs which we call UDAF equivalence and weak UDAF equivalence. UDAF equivalence is a coarser analogue of strong shift equivalence and weak UDAF equivalence is a coarser analogue of shift equivalence. Both UDAF and weak UDAF…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · semigroups and automata theory · Coding theory and cryptography
