A categorical invariant of flow equivalence of shifts
- 30 September 2014
- journal article
- research article
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- Vol. 36 (2) , 470-513
Abstract
We prove that the Karoubi envelope of a shift—defined as the Karoubi envelope of the syntactic semigroup of the language of blocks of the shift—is, up to natural equivalence of categories, an invariant of flow equivalence. More precisely, we show that the action of the Karoubi envelope on the Krieger cover of the shift is a flow invariant. An analogous result concerning the Fischer cover of a synchronizing shift is also obtained. From these main results, several flow equivalence invariants—some new and some old—are obtained. We also show that the Karoubi envelope is, in a natural sense, the best possible syntactic invariant of flow equivalence of sofic shifts. Another application concerns the classification of Markov–Dyck and Markov–Motzkin shifts: it is shown that, under mild conditions, two graphs define flow equivalent shifts if and only if they are isomorphic. Shifts with property ( $\mathscr{A}$ ) and their associated semigroups, introduced by Wolfgang Krieger, are interpreted in terms of the Karoubi envelope, yielding a proof of the flow invariance of the associated semigroups in the cases usually considered (a result recently announced by Krieger), and also a proof that property ( $\mathscr{A}$ ) is decidable for sofic shifts.
Keywords
All Related Versions
This publication has 38 references indexed in Scilit:
- Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshiftsJournal of Pure and Applied Algebra, 2007
- A hierarchy of shift equivalent sofic shiftsTheoretical Computer Science, 2005
- Bowen–Franks groups as an invariant for flow equivalence of subshiftsErgodic Theory and Dynamical Systems, 2001
- The Williams Conjecture is False for Irreducible SubshiftsAnnals of Mathematics, 1999
- Sofic shifts with synchronizing presentationsTheoretical Computer Science, 1996
- Morita equivalence for semigroupsJournal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1995
- Minimal automation for a factorial, transitive, and rational languageTheoretical Computer Science, 1989
- Topological conjugacy for sofic systemsErgodic Theory and Dynamical Systems, 1986
- Sofic systems and graphsMonatshefte für Mathematik, 1975
- On the uniqueness of the equilibrium stateTheory of Computing Systems, 1974