Hostname: page-component-77c89778f8-gq7q9 Total loading time: 0 Render date: 2024-07-17T15:00:05.110Z Has data issue: false hasContentIssue false

On subshift presentations

Published online by Cambridge University Press:  08 March 2016

WOLFGANG KRIEGER*
Affiliation:
Institut für Angewandte Mathematik, Universität Heidelberg, Im Neuenheimer Feld 294, 69120 Heidelberg, Germany email krieger@math.uni-heidelberg.de

Abstract

We consider partitioned graphs, by which we mean finite directed graphs with a partitioned edge set ${\mathcal{E}}={\mathcal{E}}^{-}\cup {\mathcal{E}}^{+}$. Additionally given a relation ${\mathcal{R}}$ between the edges in ${\mathcal{E}}^{-}$ and the edges in ${\mathcal{E}}^{+}$, and under the appropriate assumptions on ${\mathcal{E}}^{-},{\mathcal{E}}^{+}$ and ${\mathcal{R}}$, denoting the vertex set of the graph by $\mathfrak{P}$, we speak of an ${\mathcal{R}}$-graph ${\mathcal{G}}_{{\mathcal{R}}}(\mathfrak{P},{\mathcal{E}}^{-},{\mathcal{E}}^{+})$. From ${\mathcal{R}}$-graphs ${\mathcal{G}}_{{\mathcal{R}}}(\mathfrak{P},{\mathcal{E}}^{-},{\mathcal{E}}^{+})$ we construct semigroups (with zero) ${\mathcal{S}}_{{\mathcal{R}}}(\mathfrak{P},{\mathcal{E}}^{-},{\mathcal{E}}^{+})$ that we call ${\mathcal{R}}$-graph semigroups. We write a list of conditions on a topologically transitive subshift with property $(A)$ that together are sufficient for the subshift to have an ${\mathcal{R}}$-graph semigroup as its associated semigroup.

Generalizing previous constructions, we describe a method of presenting subshifts by means of suitably structured finite labeled directed graphs $({\mathcal{V}},~\unicode[STIX]{x1D6F4},\unicode[STIX]{x1D706}~)$ with vertex set ${\mathcal{V}}$, edge set $\unicode[STIX]{x1D6F4}$, and a label map that assigns to the edges in $\unicode[STIX]{x1D6F4}$ labels in an ${\mathcal{R}}$-graph semigroup ${\mathcal{S}}_{{\mathcal{R}}}(\mathfrak{P},{\mathcal{E}}^{-},{\mathcal{E}}^{-})$. We denote the presented subshift by $X({\mathcal{V}},\unicode[STIX]{x1D6F4},\unicode[STIX]{x1D706})$ and call $X({\mathcal{V}},\unicode[STIX]{x1D6F4},\unicode[STIX]{x1D706})$ an ${\mathcal{S}}_{{\mathcal{R}}}(\mathfrak{P},{\mathcal{E}}^{-},{\mathcal{E}}^{-})$-presentation.

We introduce a property $(B)$ of subshifts that describes a relationship between contexts of admissible words of a subshift, and we introduce a property $(c)$ of subshifts that in addition describes a relationship between the past and future contexts and the context of admissible words of a subshift. Property $(B)$ and the simultaneous occurrence of properties $(B)$ and $(c)$ are invariants of topological conjugacy.

We consider subshifts in which every admissible word has a future context that is compatible with its entire past context. Such subshifts we call right instantaneous. We introduce a property $RI$ of subshifts, and we prove that this property is a necessary and sufficient condition for a subshift to have a right instantaneous presentation. We consider also subshifts in which every admissible word has a future context that is compatible with its entire past context, and also a past context that is compatible with its entire future context. Such subshifts we call bi-instantaneous. We introduce a property $BI$ of subshifts, and we prove that this property is a necessary and sufficient condition for a subshift to have a bi-instantaneous presentation.

We define a subshift as strongly bi-instantaneous if it has for every sufficiently long admissible word $a$ an admissible word $c$, that is contained in both the future context of $a$ and the past context of $a$, and that is such that the word $ca$ is a word in the future context of $a$ that is compatible with the entire past context of $a$, and the word $ac$ is a word in the past context of $a$, that is compatible with the entire future context of $a$. We show that a topologically transitive subshift with property $(A)$, and associated semigroup a graph inverse semigroup ${\mathcal{S}}$, has an ${\mathcal{S}}$-presentation, if and only if it has properties $(c)$ and $BI$, and a strongly bi-instantaneous presentation, if and only if it has properties $(c)$ and $BI$, and all of its bi-instantaneous presentations are strongly bi-instantaneous.

We construct a class of subshifts with property $(A)$, to which certain graph inverse semigroups ${\mathcal{S}}(\mathfrak{P},{\mathcal{E}}^{-},{\mathcal{E}}^{+})$ are associated, that do not have ${\mathcal{S}}(\mathfrak{P},{\mathcal{E}}^{-},{\mathcal{E}}^{+})$-presentations.

We associate to the labeled directed graphs $({\mathcal{V}},\unicode[STIX]{x1D6F4},\unicode[STIX]{x1D706})$ topological Markov chains and Markov codes, and we derive an expression for the zeta function of $X({\mathcal{V}},\unicode[STIX]{x1D6F4},\unicode[STIX]{x1D706})$ in terms of the zeta functions of the topological Markov shifts and the generating functions of the Markov codes.

Type
Research Article
Copyright
© Cambridge University Press, 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Ash, C. J. and Hall, T. E.. Inverse semigroups on graphs. Semigroup Forum 11 (1975), 140145.Google Scholar
Béal, M.-P., Blockelet, M. and Dima, C.. Finite-type-Dyck shift spaces. Preprint, 2013, arXiv:1311.4223 [cs.FL].Google Scholar
Béal, M.-P., Blockelet, M. and Dima, C.. Sofic-Dyck shifts. Preprint, 2015, arXiv:1305.7413 [cs.FL].CrossRefGoogle Scholar
Béal, M.-P., Blockelet, M. and Dima, C.. Sofic-Dyck shifts. Mathematical Foundations of Computer Science 2014 (Lecture Notes in Computer Science, 8634) . Springer, Heidelberg, 2014, pp. 6374.Google Scholar
Blanchard, F. and Hansel, G.. Systèmes codés. Theoret. Comput. Sci. 44 (1986), 1749.CrossRefGoogle Scholar
Carlsen, T. M. and Matsumoto, K.. Some remarks on the C*-algebras associated to subshifts. Math. Scand. 95 (2004), 145160.Google Scholar
Costa, A. and Steinberg, B.. A categorical invariant of flow equivalence of shifts. Ergod. Th. & Dynam. Sys. doi:10.1017/etds.214.74.Google Scholar
Cuntz, J. and Krieger, W.. A class of C -algebras and topological Markov chains. Invent. Math. 56 (1980), 251268.Google Scholar
Hamachi, T. and Inoue, K.. Embeddings of shifts of finite type into the Dyck shift. Monatsh. Math. 145 (2005), 107129.Google Scholar
Hamachi, T., Inoue, K. and Krieger, W.. Subsystems of finite type and semigroup invariants of subshifts. J. Reine Angew. Math. 632 (2009), 3761.Google Scholar
Hamachi, T. and Krieger, W.. On certain subshifts and their associated monoids. Ergod. Th. & Dynam. Sys. doi:10.1017/etds.214.57.Google Scholar
Hamachi, T. and Krieger, W.. A construction of subshifts and a class of semigroups. Preprint, 2013,arXiv:1303.4158 [math.DS].Google Scholar
Inoue, K.. The zeta function, periodic points and entropies of the Motzkin shift. Preprint, 2006, arXiv:math.DS/0602100.Google Scholar
Inoue, K. and Krieger, W.. Subshifts from sofic shifts and Dyck shifts, zeta functions and topological entropy. Preprint, 2010, arXiv:1001.1839 [math.DS].Google Scholar
Inoue, K. and Krieger, W.. Excluding words from Dyck shifts. Preprint, 2013, arXiv:1305.4720 [math.DS].Google Scholar
Keller, G.. Circular codes, loop counting, and zeta-functions. J. Combin. Theory 56 (1991), 7583.CrossRefGoogle Scholar
Kitchens, B. P.. Symbolic Dynamics. Springer, Berlin, 1998.Google Scholar
Krieger, W.. On the uniqueness of the equilibrium state. Math. Syst. Theory 8 (1974), 97104.Google Scholar
Krieger, W.. On a syntactically defined invariant of symbolic dynamics. Ergod. Th. & Dynam. Sys. 20 (2000), 501516.Google Scholar
Krieger, W.. On subshifts and topological Markov chains. Numbers, Information and Complexity (Bielefeld 1998). Kluwer Academic Publishers, Boston, 2000, pp. 453472.Google Scholar
Krieger, W.. On subshifts and semigroups. Bull. Lond. Math. Soc. 38 (2006), 617624.Google Scholar
Krieger, W.. Presentations of symbolic dynamical systems by labelled directed graphs (Notes for a ‘mini-cours’, SDA2, Paris, 4–5 October 2007). Preprint, 2012, arXiv:1209.1872 [math.DS].Google Scholar
Krieger, W.. On flow-equivalence of 𝓡-graph shifts. Münster J. Math. (2015).Google Scholar
Krieger, W. and Matsumoto, K.. A lambda-graph system for the Dyck shift and its K-groups. Doc. Math. 8 (2003), 7996.Google Scholar
Krieger, W. and Matsumoto, K.. Zeta functions and topological entropy of the Markov–Dyck shifts. Münster J. Math. 4 (2011), 171184.Google Scholar
Krieger, W. and Matsumoto, K.. A notion of synchronization of symbolic dynamics and a class of C -algebras. Acta Appl. Math. 126 (2013), 263275.Google Scholar
Lawson, M. V.. Inverse Semigroups. World Scientific, Singapore, 1998.Google Scholar
Lind, D. and Marcus, B.. An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge, 1995.Google Scholar
Matsumoto, K.. Stabilized C -algebras constructed from symbolic dynamical systems. Ergod. Th. & Dynam. Sys. 20 (2000), 821841.Google Scholar
Matsumoto, K.. A simple purely infinite C -algebra associated with a lambda-graph system of the Motzkin shift. Math. Z. 248 (2004), 369394.Google Scholar
Matsumoto, K.. C -algebras arising from Dyck systems of topological Markov chains. Math. Scand. 109 (2011), 3154.Google Scholar
Matsumoto, K.. Cuntz–Krieger algebras and a generalization of the Catalan numbers. Int. J. Math. 24 (2013),1350040.Google Scholar
Nivat, M. and Perrot, J.-F.. Une généralisation du monoîd bicyclique. C. R. Acad. Sci. Paris, Ser. A 271 (1970), 824827.Google Scholar
Pin, J.-E.. Syntactic semigroups. Handbook of Formal Languages. Vol. 1. Eds. Rozenberg, G. and Salomaa, A.. Springer, Berlin, Heidelberg, New York, 1997, pp. 597746.Google Scholar