On subshift presentations

DOI10.1017/ETDS.2015.82zbMATH Open1365.37013arXiv1209.2578OpenAlexW2221075484MaRDI QIDQ2989983FDOQ2989983

Authors: Wolfgang Krieger 

Publication date: 9 June 2017

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

Abstract: We consider partitioned graphs, by which we mean finite strongly connected directed graphs with a partitioned edge set $mathcalE={mathcalE}^{-}cup{mathcalE}^{+}$. With additionally given a relation $mathcalR$ between the edges in ${mathcalE}^{-}$ and the edges in $mathcal{E}^{+}$, and denoting the vertex set of the graph by $frakP$, we speak of an an $mathcalR$-graph ${mathcalG}_{mathcalR}(frakP,{mathcalE}^{-},{mathcalE}^{+})$. From $mathcalR$-graphs ${mathcalG}_{mathcalR}(frakP,{mathcalE}^{-},{mathcalE}^{+})$ we construct semigroups (with zero) ${mathcalS}_{mathcalR}(frakP,{mathcalE}^{-},{mathcalE}^{+})$ that we call $mathcalR$-graph semigroups. We describe a method of presenting subshifts by means of suitably structured labelled directed graphs $(mathcalV,Sigma,lambda)$ with vertex set $mathcalV$, edge set $Sigma$, and a label map that asigns to the edges in $Sigma$ labels in an $mathcalR$-graph semigroup ${mathcalS}_{mathcalR}(frakP,{mathcalE}^{-},{mathcalE}^{-})$. We call the presented subshift an ${mathcalS}_{mathcalR}(frakP,{mathcalE}^{-},{mathcalE}^{-})$-presentation. We introduce a Property $(B)$ and a Property (c), tof subshifts, and we introduce a notion of strong instantaneity. Under an assumption on the structure of the $mathcalR$-graphs ${mathcalG}_{mathcalR}(frakP,{mathcalE}^{-},{mathcalE}^{-})$ we show for strongly instantaneous subshifts with Property $(A)$ and associated semigroup ${mathcalS}_{mathcalR}(frakP,{mathcalE}^{-},{mathcalE}^{-})$, that Properties $(B)$ and (c) are necessary and sufficient for the existence of an ${mathcalS}_{mathcalR}(frakP,{mathcalE}^{-},{mathcalE}^{-})$-presentation, to which the subshift is topologically conjugate,

Full work available at URL: https://arxiv.org/abs/1209.2578

Recommendations

• Presentations of subshifts and their topological conjugacy invariants
• ON SUBSHIFTS AND SEMIGROUPS
• Presentations of Schützenberger groups of minimal subshifts.
• Two notes on subshifts
• On the structure of generic subshifts
• Playing with subshifts
• Subshifts and perforation
• Substitution subshifts and Bratteli diagrams
• Subshifts, rotations and the specification property
• Presentations for subgroups of monoids

zbMATH Keywords

zeta functiongraph inverse semigrouptopological Markov chaintopologically transitive subshiftMarkov code

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Dynamical systems involving maps of trees and graphs (37E25)

Cites Work

• A class of C*-algebras and topological Markov chains
• On a syntactically defined invariant of symbolic dynamics
• Title not available (Why is that?)
• An Introduction to Symbolic Dynamics and Coding
• Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
• Embedding of shifts of finite type into the Dyck shift
• Circular codes, loop counting, and zeta-functions
• On the uniqueness of the equilibrium state
• Title not available (Why is that?)
• Systèmes codés. (Coded systems)
• Inverse semigroups on graphs
• A categorical invariant of flow equivalence of shifts
• ON SUBSHIFTS AND SEMIGROUPS
• Title not available (Why is that?)
• Some remarks on the $C^*$-algebras associated with subshifts
• A lambda-graph system for the Dyck shift and its \(K\)-groups
• Subsystems of finite type and semigroup invariants of subshifts
• A notion of synchronization of symbolic dynamics and a class of \(C ^{\ast }\)-algebras
• Title not available (Why is that?)
• A simple purely infinite \(C^*\)-algebra associated with a lambda-graph system of the Motzkin shift
• \(C^\ast\)-algebras arising from Dyck systems of topological Markov chains
• Stabilized $C^*$-algebras constructed from symbolic dynamical systems
• Cuntz-Krieger algebras and a generalization of Catalan numbers
• Zeta functions and topological entropy of the Markov-Dyck shifts
• Sofic-Dyck shifts
• On certain subshifts and their associated monoids
• On flow-equivalence of \({\mathcal R}\)-graph shifts
• A construction of subshifts and a class of semigroups

Cited In (10)

• Shannon graphs, subshifts and lambda-graph systems.
• Graph subshifts
• Markov-Dyck shifts, neutral periodic points and topological conjugacy
• On the transition semigroups of centrally labeled Rauzy graphs.
• Some notes on the classification of shift spaces: shifts of finite type; sofic shifts; and finitely defined shifts
• Encodings of trajectories and invariant measures
• On flow-equivalence of \({\mathcal R}\)-graph shifts
• Sofic-Dyck shifts
• A construction of subshifts and a class of semigroups
• On $g$-functions for subshifts

This page was built for publication: On subshift presentations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989983)