Is Every Irreducible Shift of Finite Type Flow Equivalent to a Renewal System?
From MaRDI portal
(Redirected from Publication:5244497)
Abstract: Is every irreducible shift of finite type flow equivalent to a renewal system? For the first time, this variation of a classic problem formulated by Adler is investigated, and several partial results are obtained in an attempt to find the range of the Bowen--Franks invariant over the set of renewal systems of finite type. In particular, it is shown that the Bowen--Franks group is cyclic for every member of a class of renewal systems known to attain all entropies realised by shifts of finite type, and several classes of renewal systems with non--trivial values of the invariant are constructed.
Recommendations
- Flow equivalence of reducible shifts of finite type
- Flow equivalence of subshifts of finite type
- Renewal Systems, Sharp-Eyed Snakes, and Shifts of Finite Type
- Flow equivalence of reducible shifts of finite type and Cuntz-Krieger algebras.
- Flow equivalence and orbit equivalence for shifts of finite type and isomorphism of their groupoids
- Flow equivalence of shifts of finite type via positive factorizations.
- A weak equivalence between shifts of finite type
- Weak equivalence for shifts of finite type
- On some new invariants for shift equivalence for shifts of finite type
- Flow equivalence and isotopy for subshifts
Cited in
(4)
This page was built for publication: Is Every Irreducible Shift of Finite Type Flow Equivalent to a Renewal System?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5244497)