Every braid admits a short sigma-definite expression
Author(s) -
Jean Fromentin
Publication year - 2011
Publication title -
journal of the european mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.549
H-Index - 64
eISSN - 1435-9863
pISSN - 1435-9855
DOI - 10.4171/jems/289
Subject(s) - mathematics , braid , sigma , expression (computer science) , combinatorics , pure mathematics , braid theory , braid group , materials science , composite material , programming language , physics , quantum mechanics , computer science
A result by Dehornoy (1992) says that every nontrivial braid admits a σ -definite expression, defined as a braid word in which the generator σi with maximal index i appears with exponents that are all positive, or all negative. This is the ground result for ordering braids. In this paper, we enhance this result and prove that every braid admits a σ -definite word expression that, in addition, is quasi-geodesic. This establishes a longstanding conjecture. Our proof uses the dual braid monoid and a new normal form called the rotating normal form.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom