Topological size of scrambled sets for local dendrite maps
From MaRDI portal
Publication:2435286
The paper under review deals with the problem of analyzing the structure of the scrambled sets for a map \(f:X\to X\) where \(X\) is a local dendrite. It is proved that the scrambled set of \(f\) is totally disconnected and hence it has empty interior. Moreover, it is proved that scrambled sets are nowhere dense residual if the set of branch points of \(X\) is discrete.
Recommendations
Cites work
- $\overline{R} = \overline{P}$ FOR MAPS OF DENDRITES X WITH Card(End(X)) < c
- Dynamics of monotone graph, dendrite and dendroid maps
- Homeomorphisms with the whole compacta being scrambled sets
- scientific article; zbMATH DE number 7227247 (Why is no real title available?)
- scientific article; zbMATH DE number 53928 (Why is no real title available?)
- On Scrambled Sets for Chaotic Functions
- Scrambled sets of continuous maps of 1-dimensional polyhedra
- Topological size of scrambled sets
Cited in
(9)- Group action on local dendrites
- Equicontinuity of maps on local dendrites
- The depths and the attracting centres for continuous maps on local dendrites with the number of branch points being finite
- Minimal sets for group actions on dendrites
- Topological size of scrambled sets
- Recurrence and nonwandering sets of local dendrite maps
- Cardinalities of scrambled sets and positive scrambled sets
- One-dimensional systems without periodic points
- \(\omega\)-limit sets for monotone local dendrite maps
This page was built for publication: Topological size of scrambled sets for local dendrite maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2435286)