The construction of a completely scrambled system by graph covers
From MaRDI portal
Publication:2790926
DOI10.1090/proc/12963zbMath1358.37027arXiv1509.05535OpenAlexW2964192152MaRDI QIDQ2790926
No author found.
Publication date: 8 March 2016
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.05535
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Almost minimal systems and periodicity in hyperspaces ⋮ A mixing completely scrambled system exists ⋮ Bratteli-Vershik models and graph covering models ⋮ Graph covers of higher dimensional dynamical systems ⋮ Shifts of finite type as fundamental objects in the theory of shadowing ⋮ Rank 2 proximal Cantor systems are residually scrambled
Cites Work
- Invariant scrambled sets, uniform rigidity and weak mixing
- Special homeomorphisms and approximation for Cantor systems
- Continuous maps with the whole space being a scrambled set
- Entropy sets, weakly mixing sets and entropy capacity
- Algebraic topology for minimal Cantor sets
- Homeomorphisms with the whole compacta being scrambled sets
- Graph covers and ergodicity for zero-dimensional systems
- Generically there is but one self homeomorphism of the Cantor set
- Period Three Implies Chaos
- Locally equicontinuous dynamical systems
- ORDERED BRATTELI DIAGRAMS, DIMENSION GROUPS AND TOPOLOGICAL DYNAMICS
This page was built for publication: The construction of a completely scrambled system by graph covers
