Effective dynamical systems beyond dimension zero and factors of SFTs
- 11 October 2024
- journal article
- research article
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- p. 1-41
Abstract
Using tools from computable analysis, we develop a notion of effectiveness for general dynamical systems as those group actions on arbitrary spaces that contain a computable representative in their topological conjugacy class. Most natural systems one can think of are effective in this sense, including some group rotations, affine actions on the torus and finitely presented algebraic actions. We show that for finitely generated and recursively presented groups, every effective dynamical system is the topological factor of a computable action on an effectively closed subset of the Cantor space. We then apply this result to extend the simulation results available in the literature beyond zero-dimensional spaces. In particular, we show that for a large class of groups, many of these natural actions are topological factors of subshifts of finite type.Keywords
All Related Versions
Funding Information
- HORIZON EUROPE Marie Sklodowska-Curie Actions (731143)
- Comisión Nacional de Investigación Científica y Tecnológica (2020-21201185)
- Fondo Nacional de Desarrollo Científico y Tecnológico (11200037)
- Fondo Nacional de Desarrollo Científico y Tecnológico (1230469)
- Fondo Nacional de Desarrollo Científico y Tecnológico (1240085)
This publication has 25 references indexed in Scilit:
- Handbook of Computability and Complexity in Analysis2021
- Ergodic Theory2016
- Homoclinic groups, IE groups, and expansive algebraic actionsInventiones Mathematicae, 2014
- Effective Closed Subshifts in 1D Can Be Implemented in 2D2010
- On the dynamics and recursive properties of multidimensional symbolic systemsInventiones Mathematicae, 2008
- Computable symbolic dynamicsMathematical Logic Quarterly, 2008
- Mahler measure and entropy for commuting automorphisms of compact groupsInventiones Mathematicae, 1990
- Undecidability and nonperiodicity for tilings of the planeInventiones Mathematicae, 1971
- Endomorphisms and automorphisms of the shift dynamical systemTheory of Computing Systems, 1969
- Proving Theorems by Pattern Recognition, II1961