An embedding theorem for subshifts over amenable groups with the comparison property
Robert Bland

TL;DR
This paper proves an embedding theorem for symbolic dynamical systems over amenable groups with the comparison property, extending classical results to a broader group setting using tiling theory.
Contribution
It extends classical embedding results to subshifts over amenable groups with the comparison property, utilizing tiling and quasi-tiling techniques.
Findings
Embedding theorem for subshifts over amenable groups
Extension of Krieger's classical result to broader groups
Use of tiling theory in dynamical systems
Abstract
We obtain the following embedding theorem for symbolic dynamical systems. Let be a countable amenable group with the comparison property. Let be a strongly aperiodic subshift over . Let be a strongly irreducible shift of finite type over which has no global period, meaning that the shift action is faithful on . If the topological entropy of is strictly less than that of , and contains at least one factor of , then embeds into . This result partially extends the classical result of Krieger when and the results of Lightwood when for . The proof relies on recent developments in the theory of tilings and quasi-tilings of amenable groups.
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 · Quasicrystal Structures and Properties
