Abstract
We define a notion of pattern for finite invariant sets of continuous maps of finite trees. A pattern is essentially a homotopy class relative to the finite invariant set. Given such a pattern, we prove that the class of tree maps which exhibit this pattern admits a canonical representative, that is a tree and a continuous map on this tree, which satisfies several minimality properties. For instance, it minimizes topological entropy in its class and its dynamics are minimal in a sense to be defined. We also give a formula to compute the minimal topological entropy directly from the combinatorial data of the pattern. Finally we prove a characterization theorem for zero entropy patterns.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
