Still another approach to the braid ordering
arXiv:math/0506495
Abstract
We develop a new approach to the linear ordering of the braid group , based on investigating its restriction to the set $\Div(Δ\_n^d)$ of all divisors of in the monoid , i.e., to positive -braids whose normal form has length at most . In the general case, we compute several numerical parameters attached with the finite orders $(\Div(Δ\_n^d), <)$. In the case of 3 strands, we moreover give a complete description of the increasing enumeration of $(\Div(Δ\_3^d), <)$. We deduce a new and specially direct construction of the ordering on , and a new proof of the result that its restriction to is a well-ordering of ordinal type .