On subshift presentations

DOI10.1017/ETDS.2015.82MaRDI QIDQ2989983zbMATH OpenOpenAlexFDO

Authors Wolfgang Krieger

Publication date 9 June 2017

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

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

zbMATH Keywords

graph inverse semigroupMarkov codetopological Markov chaintopologically transitive subshiftzeta function

Mathematics Subject Classification ID

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

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,

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

Cites work

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

Cited in

(10)

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

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)