Alternation conjecture for braids of maximal entropy

From papers

Let n2n\ge 2 and let βBr(n)\beta\in\operatorname{Br}(n). If

β=σi1ϵ1σikϵk\beta=\sigma_{i_1}^{\epsilon_1}\cdots\sigma_{i_k}^{\epsilon_k}

with ik+1=ik±1i_{k+1}=i_k\pm1, ϵk=1|\epsilon_k|=1, and ϵk+1=ϵk\epsilon_{k+1}=-\epsilon_k, call β\beta alternated with respect to the standard generators. A braid is of maximal entropy when

h(β)=max{h(β)l(β)l(β)}.h(\beta)=\max\{h(\beta')\mid l(\beta')\le l(\beta)\}.

Alternation conjecture. Braids with maximal entropy are alternated. The conjecture concerns the observed structure of entropy-maximizing braids among those considered by word length.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Jacques-Olivier Moussafir, “On computing the entropy of braids”, arXiv:math/0603355 (2006).

Solutions 0

No solutions have been posted yet.