Coded equivalence of one-sided topological Markov shifts
Kengo Matsumoto

TL;DR
This paper introduces a new concept called coded equivalence for one-sided topological Markov shifts, showing it implies continuous orbit equivalence and is inspired by coding theory.
Contribution
The paper defines coded equivalence for one-sided topological Markov shifts and establishes its relationship with existing notions like topological conjugacy and orbit equivalence.
Findings
Coded equivalence implies continuous orbit equivalence.
One-sided topological conjugacy implies coded equivalence.
The notion is inspired by coding theory.
Abstract
We introduce a notion of coded equivalence in one-sided topological Markov shifts. The notion is inspired by coding theory. One-sided topological conjugacy implies coded equivalence. We will show that coded equivalence implies continuous orbit equivalence of one-sided topological Markov shifts.
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
TopicsCellular Automata and Applications · Mathematical Dynamics and Fractals · semigroups and automata theory
