Still another approach to the braid ordering
Abstract
We develop a new approach to the linear ordering of the braid group B\n, based on investigating its restriction to the set (\nd) of all divisors of \nd in the monoid B\∞+, i.e., to positive n-braids whose normal form has length at most d. In the general case, we compute several numerical parameters attached with the finite orders ((\nd), <). In the case of 3 strands, we moreover give a complete description of the increasing enumeration of ((\3d), <). We deduce a new and specially direct construction of the ordering on B\3, and a new proof of the result that its restriction to B\3+ is a well-ordering of ordinal type ωω.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.