Abstract
We present a fast method for computing the topological entropy of braids on the torus. This work is motivated by the need to analyze large braids when studying two‐dimensional flows via the braiding of a large number of particle trajectories. Our approach is a generalization of Moussafir’s technique for braids on the disk. Previous methods for computing topological entropy include the Bestvina–Handel train‐track algorithm and matrix representations of the braid group. However, the Bestvina–Handel algorithm is computationally intractable for large braid words, and matrix methods give only lower bounds, which are often poor for large braids. Our method is computationally fast and gives exponential convergence towards the exact entropy. As an illustration we apply our approach to the braiding of both periodic and aperiodic trajectories in the sine flow.
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.
