Trees with snowflakes and zero entropy maps
A one-dimensional connected and contractible branching manifold with finitely many branching points is called a tree, and a finite union of trees is called a forest. The main result of the paper is theorem 3, which gives necessary and sufficient conditions that a continuous self- mapping of a forest has zero entropy. This generalizes the corresponding statement for maps of the interval based on Sharkovskij's theorem [\textit{A. N. Sharkovskij}, Ukr. Mat. J. 16, 61-71 (1964; Zbl 0122.175)] on the structure of periodic points and on Misiurewicz's theorem [\textit{M. Misiurewicz}, Bull. Pol. Acad. Sci., Sér. Sci. Math. 27, 167-169 (1979; Zbl 0423.54032)] on the existence of horseshoes for positive entropy maps.
- Entropy, periodicity, and graphs with zero Euler characteristic
- Forward triplets and topological entropy on trees
- On -limit sets of non-autonomous discrete systems on trees
- On the minimum positive entropy for cycles on trees
- Topological entropy and periods of graph maps
- Functional Rotation Numbers for One-Dimensional Maps
- No division and the set of periods for tree maps
- Li-Yorke chaos for dendrite maps with zero topological entropy and \(\omega\)-limit sets
- The positive entropy kernel for some families of trees
- Equivalent conditions of a tree map with zero topological entropy
- Characterization of the tree cycles with minimum positive entropy for any period
- On topological entropy of commuting tree maps
- Random conformal snowflakes
This page was built for publication: Trees with snowflakes and zero entropy maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1327333)