scientific article; zbMATH DE number 1163254
A tree \(T\) is a union of a finite number of intervals. If \(A\) is a finite subset of \(T\), the authors define an equivalence relation on the class of all pairs \((T,A)\) by a map \(\Phi:A\to A'\) preserving discrete components. An equivalence class of this relation together with an equivalence class of maps \(\theta:A\to A\) (i.e., \(\theta,\theta'\) are equivalent if \(\Phi^{-1}\theta\Phi= \theta')\) is called a pattern. The authors announce the results of a paper to be published elsewhere. These results are concerned with (a) the computation of the topological entropy of maps \(f:T\to T\) exhibiting the pattern (Theorem A) (b) representation by canonial models (Theorem B) (c) uniqueness properties of `best' representations of a class (Theorem C) (d) `pattern forcing' (Theorem D). For analoguous results for maps of the interval and the patterns of periodic points, see [\textit{M. Misiurewicz} and \textit{Z. Nitecki}, Mem. Am. Math. Soc. 456 (1991; Zbl 0745.58019)]. For the entire collection see [Zbl 0884.00031].
- Canonical representatives for patterns of tree maps
- Rooted tree maps
- Trees, dendrites and the Cannon-Thurston map
- Kneading theory for tree maps
- scientific article; zbMATH DE number 4065010 (Why is no real title available?)
- A simple model of trees for unicellular maps
- TOWARD A THEORY OF FORCING ON MAPS OF TREES
- Topological and algebraic reducibility for patterns on trees
- Rotation numbers for certain maps of an n-od
- On the preservation of combinatorial types for maps on trees.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4394764)