Topological entropy of transitive maps of a tree

The aim of this paper is to obtain the infimum of topological entropies of transitive maps on a given tree. Given a tree \(T\), a point \(x\in T\) is called an end, if \(T\setminus\{x\}\) is connected. End(T) denotes the number of ends of the tree \(T\). \(L(T)\) is the infimum of the topological entropies of transitive maps of \(T\). The author proves that if \(f\) is a transitive map of a tree \(T\), then there is \(1\leq k\leq \)End(T) such that \(f^k\) has a horseshoe. This result leads to the estimate \( L(T)\geq (1/\text{End }(T))\log{2}\). Some general properties of transitive maps of a tree and the lower bounds for topological entropy of a particular class of tree maps, called marked maps, are also derived. It is proved that the set of trees can be decomposed into pairwise disjoint and infinite subsets \({\mathcal P}(i)\), \(i\in\{0\}\cup\mathbb{N}\). Based on this decomposition one obtains the infimum \(L(T)\) for a large class of trees. Namely, it is proved that for \(T\in{\mathcal P}(i), i=0,1\), \(L(T)=(1/ \text{End}(T)-i)\log{2}\), and for \(i\geq 2\), \(L(T)\leq (1/ \text{End}(T)-i)\log{2}\). Finally, is it shown that there is a tree \(T\) such that the topological entropy of each transitive map of \(T\) is larger than \(L(T)\).

Recommendations

Cited in

(20)

This page was built for publication: Topological entropy of transitive maps of a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4944635)