On computing the entropy of braids
Jacques-Olivier Moussafir
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.
Create a lesson
Related papers
A blueprint for the formalization of norm-variation of multiple ergodic averages for commuting transformations
Floris van Doorn, Polona Durcik, Joris Roos et al.
On some aspects of discrete groups acting ergodically on the boundary
Subhadip Dey, Mikołaj Frączyk, Sebastian Hurtado
A Structural Theory of Admissible Transitions in Biological Reaction Networks
Stephan Peter, Bashar Ibrahim
Sequential and distributive dual futile cycle: Hopf bifurcation can occur under parameter-rich kinetics but cannot occur under mass action kinetics
Nicola Vassena
Rigidity on the two-torus and Sarnak's conjecture
Yinshan Chang, Jian Wang, Junchang Zhou
Linear response for random systems with a cusp
Davrbek Oltiboev, Karim Rakhimov, Marks Ruziboev