A simple algorithm for finding short sigma-definite representatives.
From MaRDI portal
Publication:420741
DOI10.1016/j.jalgebra.2011.09.039zbMath1243.20049arXiv1101.1400MaRDI QIDQ420741
Publication date: 23 May 2012
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1101.1400
68W30: Symbolic computation and algebraic computation
20M05: Free semigroups, generators and relations, word problems
20F36: Braid groups; Artin groups
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
20-04: Software, source code, etc. for problems pertaining to group theory
06F05: Ordered semigroups and monoids
Related Items
Cites Work
- 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
- Ordering the braid groups
- On the complexity of braids.
- A NORMAL FORM FOR BRAIDS
- THE WELL-ORDERING OF DUAL BRAID MONOID
- Left-distributive idempotent algebras
- Braid Groups and Left Distributive Operations
- Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
- THE BRAID GROUP AND OTHER GROUPS