Entropy of transitive tree maps (Q2565086): Difference between revisions

A tree \(T\) is a connected finite union of intervals, not containing homeomorphic images of \(S^1\). Let \(L(T)\) denote the infimum of topological entropies of transitive maps \(f:T\to T\). It is conjectured that \(L(T)\) is actually attained. The authors show here that \[ L(T)\geq {\log 2\over \text{End} (T)}, \] where \(\text{End} (T)\) denotes the number of ends of \(T\). Several comments and corollaries are also contained in the introduction. The result extends [\textit{A. M. Blokh}, Russ. Math. Surv. 37, No. 2, 203-204 (1982); translation from Usp. Mat. Nauk 37, No. 2, 189-190 (1982; Zbl 0501.28010)] and [\textit{J. Franks} and \textit{M. Misiurewicz}, Contemp. Math. 152, 69-139 (1993; Zbl 0793.58029)].