Jacques-Olivier Moussafir
Published 2006-03-14, updated 2006-06-18Version 4
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.
A new proof of a conjecture of Yoccoz, Remarks, New results
Large intersection of univoque bases of real numbers
A test for a conjecture on the nature of attractors for smooth dynamical systems
![QR code for arXiv:math/0603355 [math.DS]](http://oss.arxitics.com/images/favicon.svg)