A categorical invariant of flow equivalence of shifts
arXiv:1304.3487 · doi:10.1017/etds.2014.74
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 (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 (A) is decidable for sofic shifts.
References in corpus (9)
- Graph inverse semigroups, groupoids and their C*-algebras
- Flow equivalence of sofic shifts
- A categorical invariant of flow equivalence of shifts
- On subshift presentations
- Strong Morita Equivalence of Inverse Semigroups
- A Construction of Subshifts and a Class of Semigroups
- On Certain Subshifts and their Associated Monoids
- On Flow Equivalence of Sofic Shifts
- The Schützenberger category of a semigroup
Cited by in corpus (8)
- Topological Graph Inverse Semigroups
- Flow equivalence of sofic shifts
- The Structure of a Graph Inverse Semigroup
- A categorical invariant of flow equivalence of shifts
- On subshift presentations
- Graph inverse semigroups and Leavitt path algebras
- On the Markov-Dyck shifts of vertex type
- Pushdown automata, lambda-graph systems and C*-algebras