A result by Dehornoy (1992) says that every nontrivial braid admits a sigma-definite word representative, defined as a braid word in which the generator sigma_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 sigma-definite word representative 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
International audienceWe study the rational permutation braids, that is the elements of an Artin-Tit...
International audienceWe study the rational permutation braids, that is the elements of an Artin-Tit...
We give an explicit geometric argument that Artin’s braid group Bn is right-orderable. The construct...
A result by Dehornoy (1992) says that every nontrivial braid admits a sigma-definite word representa...
AbstractWe describe a new algorithm which for each braid returns a quasi-geodesic σ-definite word re...
11 pagesInternational audienceWe describe a new algorithm which for each braid returns a quasi-geode...
11 pagesInternational audienceWe describe a new algorithm which for each braid returns a quasi-geode...
By definition, a braid is an equivalence class of braid words.Various normal forms have been describ...
By definition, a braid is an equivalence class of braid words.Various normal forms have been describ...
By definition, a braid is an equivalence class of braid words.Various normal forms have been describ...
AbstractWe describe a new algorithm which for each braid returns a quasi-geodesic σ-definite word re...
17 pages, 6 figuresWe suggest a new algorithm for finding a canonical representative of a given brai...
AbstractThis paper studies Artin's braid monoids using combinatorial methods. More precisely, we inv...
We give an explicit geometric argument that Artin's braid group Bn is right-orderable. The construct...
International audienceWe study the rational permutation braids, that is the elements of an Artin-Tit...
International audienceWe study the rational permutation braids, that is the elements of an Artin-Tit...
International audienceWe study the rational permutation braids, that is the elements of an Artin-Tit...
We give an explicit geometric argument that Artin’s braid group Bn is right-orderable. The construct...
A result by Dehornoy (1992) says that every nontrivial braid admits a sigma-definite word representa...
AbstractWe describe a new algorithm which for each braid returns a quasi-geodesic σ-definite word re...
11 pagesInternational audienceWe describe a new algorithm which for each braid returns a quasi-geode...
11 pagesInternational audienceWe describe a new algorithm which for each braid returns a quasi-geode...
By definition, a braid is an equivalence class of braid words.Various normal forms have been describ...
By definition, a braid is an equivalence class of braid words.Various normal forms have been describ...
By definition, a braid is an equivalence class of braid words.Various normal forms have been describ...
AbstractWe describe a new algorithm which for each braid returns a quasi-geodesic σ-definite word re...
17 pages, 6 figuresWe suggest a new algorithm for finding a canonical representative of a given brai...
AbstractThis paper studies Artin's braid monoids using combinatorial methods. More precisely, we inv...
We give an explicit geometric argument that Artin's braid group Bn is right-orderable. The construct...
International audienceWe study the rational permutation braids, that is the elements of an Artin-Tit...
International audienceWe study the rational permutation braids, that is the elements of an Artin-Tit...
International audienceWe study the rational permutation braids, that is the elements of an Artin-Tit...
We give an explicit geometric argument that Artin’s braid group Bn is right-orderable. The construct...