Translation algorithms for graph covers
From MaRDI portal
Cites work
- A Cantor dynamical system is slow if and only if all its finite orbits are attracting
- A mixing completely scrambled system exists
- Algebraic topology for minimal Cantor sets
- All minimal Cantor systems are slow
- Almost minimal systems and periodicity in hyperspaces
- Bratteli-Vershik models and graph covering models
- Bratteli-Vershik models for Cantor minimal systems associated to interval exchange transformations
- Cantor aperiodic systems and Bratteli diagrams
- Edrei's conjecture revisited
- Ergodic theory of interval exchange maps
- Exact number of ergodic invariant measures for Bratteli diagrams
- Finite rank Bratteli diagrams: structure of invariant measures
- Generically there is but one self homeomorphism of the Cantor set
- Graph covers and ergodicity for zero-dimensional systems
- Graph covers of higher dimensional dynamical systems
- Graph theoretic structure of maps of the Cantor space
- scientific article; zbMATH DE number 3153217 (Why is no real title available?)
- scientific article; zbMATH DE number 3871492 (Why is no real title available?)
- scientific article; zbMATH DE number 3760821 (Why is no real title available?)
- scientific article; zbMATH DE number 48343 (Why is no real title available?)
- scientific article; zbMATH DE number 3598702 (Why is no real title available?)
- Interval exchange transformations
- Linearly recurrent subshifts have a finite number of non-periodic subshift factors
- On factor graphs of DOL words
- On the number of ergodic measures for minimal shifts with eventually constant complexity growth
- On the theory of diophantine approximations. I1 (on a problem of A. Ostrowski)
- ORDERED BRATTELI DIAGRAMS, DIMENSION GROUPS AND TOPOLOGICAL DYNAMICS
- Physical measures for infinitely renormalizable Lorenz maps
- Rank and symbolic complexity
- Représentation géométrique de suites de complexité 2n+1
- Rigidity in topological dynamics
- Sensitive dependence on initial conditions
- Sequences with subword complexity \(2n\)
- Shifts of finite type as fundamental objects in the theory of shadowing
- Special homeomorphisms and approximation for Cantor systems
- Substitutional dynamical systems, Bratteli diagrams and dimension groups
- Substitutions in dynamics, arithmetics and combinatorics
- Symbolic dynamics II. Sturmian trajectories.
- The construction of a completely scrambled system by graph covers
- Topological and Ergodic Theory of Symbolic Dynamics
This page was built for publication: Translation algorithms for graph covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7009776)