Minimal subshifts of prescribed mean dimension over general alphabets
Xiangtong Wang, Hang Zhao

TL;DR
This paper constructs minimal subshifts with prescribed mean dimension over general alphabets, demonstrating the range of mean dimensions achievable within such dynamical systems.
Contribution
It introduces methods to realize any mean dimension value within a certain interval for minimal subshifts over amenable groups.
Findings
Constructed minimal subshifts with any mean dimension in [0, mdim(K^G,σ))
Created a subshift with mean dimension 1 over [0,1]^G
Showed the set of attainable mean dimensions of minimal subsystems is [0,1)
Abstract
Let be a countable infinite amenable group, a finite-dimensional compact metrizable space, and the full -shift on . For any , we construct a minimal subshift of with mdim. Furthermore, we construct a subshift of such that its mean dimension is , and that the set of all attainable values of the mean dimension of its minimal subsystems is exactly the interval .
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 · graph theory and CDMA systems · semigroups and automata theory
