Abstract
We consider the problem of computing the entropy of a braid. We recall its definition and for each braid construct a sequence of real numbers whose limit is the braid’s entropy. We state one conjecture on the convergence speed and two conjectures on braids that have high entropy but are written with few letters.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Boyland P (1994) Topological methods in surface dynamics. Topology Appl 58(3):223–298
Fathi A, Laudenbach F, Poenaru V (1991) Travaux de Thurston sur les surfaces. Séminaire Orsay, 2nd edn, Astérisque, vols 66, 67. Centre National de la Recherche Scientifique
Bestvina M, Handel M (1995) Train-tracks for surface homeomorphisms. Topology 34(1):109–140
Dynnikov IA, Wiest B (2004) On the complexity of braids. http://hal.ccsd.cnrs.fr/. Cited 26 May 2006
Katok A, Hasselblatt B (1995) Introduction to the modern theory of dynamical systems. Cambridge Univ Press, Cambridge
Dynnikov IA (2002) On a Yang-Baxter mapping and the Dehornoy ordering. Russ Math Surveys 57(3):592–594
Birman JS (1974) Braids, links, and mapping class groups. Princeton Univ Press, Princeton
Shoup V (2001) Ntl: a library for doing number theory. http://www.shoup.net. Cited 26 May 2006
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Moussafir, JO. On computing the entropy of braids. Funct. Anal. Other Math. 1, 37–46 (2006). https://doi.org/10.1007/s11853-007-0004-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11853-007-0004-x