On computing the entropy of braids
From MaRDI portal
Abstract: We consider in this paper the problem of computing the entropy of a braid. We recall its definition and construct, for each braid, a sequence of real numbers, whose limit is its entropy. We state one conjecture about the convergence speed, and two about the braids that have high entropy, but are written with few letters.
Recommendations
- ENTROPIES OF BRAIDS
- The Burau estimate for the entropy of a braid
- On the topological entropy of families of braids
- Computation of the ordinal of braids
- Topological Entropy of Braids on the Torus
- UPPER AND LOWER BOUNDS FOR THE MINIMAL POSITIVE ENTROPY OF PURE BRAIDS
- Braids, conformal module and entropy
- On the complexity of braids.
- Braid computations for the crossing number of Klein links
- Topological entropy of surface braids and maximally efficient mixing
Cites work
Cited in
(16)- On the topological entropy of families of braids
- Closed-form expression for the braid entropy in the group \(B_3\)
- Topological entropy and secondary folding
- Dynnikov and train track transition matrices of pseudo-Anosov braids
- Braids, conformal module and entropy
- Geometric intersection of curves on punctured disks
- Intersections of multicurves from Dynnikov coordinates
- Finite-time braiding exponents
- Integral laminations on nonorientable surfaces
- Geometric mixing
- Dynnikov coordinates on punctured torus
- Counting components of an integral lamination
- Topological entropy of surface braids and maximally efficient mixing
- The entropy efficiency of point-push mapping classes on the punctured disk
- Is chaotic advection inherent to heterogeneous Darcy flow?
- Quadratic-time computations for pseudo-Anosov mapping classes
This page was built for publication: On computing the entropy of braids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q952228)