Every braid admits a short sigma-definite expression.
DOI10.4171/JEMS/289zbMath1235.20035arXiv0811.3902OpenAlexW2012187204MaRDI QIDQ645351
Publication date: 14 November 2011
Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0811.3902
algorithmsbraid groupsbraid orderingnormal form theoremsArtin generatorsBirman-Ko-Lee generatorsdual braid monoidsigma-definite expression
Free semigroups, generators and relations, word problems (20M05) Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Ordered semigroups and monoids (06F05)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- A fast method for comparing braids
- A well-ordering of dual braid monoids.
- Alternating normal forms for braids and locally Garside monoids.
- A new approach to the word and conjugacy problems in the braid groups
- The wellordering on positive braids
- Complete positive group presentations.
- Ordering the braid groups
- Springer theory in braid groups and the Birman-Ko-Lee monoid.
- On the complexity of braids.
- On finite Thurston-type orderings of braid groups
- Groupes de Garside
- The dual braid monoid
- A NORMAL FORM FOR BRAIDS
- Left-distributive idempotent algebras
- Braid Groups and Left Distributive Operations
- THE BRAID GROUP AND OTHER GROUPS
This page was built for publication: Every braid admits a short sigma-definite expression.