Abstract

We answer the following question: given any n ∈ ℕ, which is the minimum number of endpoints en of a tree admitting a zero‐entropy map f with a periodic orbit of period n? We prove that , where n = s1s2 … sk is the decomposition of n into a product of primes such that si ≤ si+1 for 1 ≤ i < k. As a corollary, we get a criterion to decide whether a map f defined on a tree with e endpoints has positive entropy: if f has a periodic orbit of period m with em > e, then the topological entropy of f is positive.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.