Shift equivalence implies flow equivalence for shifts of finite type
Mike Boyle

TL;DR
This paper proves that for shifts of finite type, shift equivalence of their defining matrices guarantees flow equivalence of the shifts, establishing a significant connection between these two concepts.
Contribution
It demonstrates that shift equivalence implies flow equivalence for shifts of finite type, clarifying the relationship between these classifications.
Findings
Shift equivalence implies flow equivalence for shifts of finite type
Establishes a direct link between matrix-based and dynamical classifications
Enhances understanding of the structure of shifts of finite type
Abstract
Shifts of finite type defined from shift equivalent matrices must be flow equivalent.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals
