Subsystem entropies of shifts of finite type and sofic shifts on countable amenable groups
Robert Bland, Kevin McGoff, Ronnie Pavlov

TL;DR
This paper investigates the distribution of entropies among subsystems of shifts of finite type and sofic shifts on countable amenable groups, showing that these entropies are densely distributed within certain intervals.
Contribution
It proves that for countable amenable groups, the entropies of SFT subsystems are dense in the interval from zero to the system's entropy, extending to sofic shifts and relative cases.
Findings
Entropies of SFT subsystems are dense in [0, h(X)] for positive entropy shifts.
The result extends to sofic shifts, not just SFTs.
For subshifts Y with lower entropy, SFTs between Y and X have entropies dense in [h(Y), h(X)].
Abstract
In this work we study the entropies of subsystems of shifts of finite type (SFTs) and sofic shifts on countable amenable groups. We prove that for any countable amenable group , if is a -SFT with positive topological entropy , then the entropies of the SFT subsystems of are dense in the interval . In fact, we prove a "relative" version of the same result: if is a -SFT and is a subshift such that , then the entropies of the SFTs for which are dense in . We also establish analogous results for sofic -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
TopicsMathematical Dynamics and Fractals · Cellular Automata and Applications
