A simple algorithm for finding short sigma-definite representatives.
DOI10.1016/J.JALGEBRA.2011.09.039zbMATH Open1243.20049arXiv1101.1400OpenAlexW2963284565MaRDI QIDQ420741FDOQ420741
Authors: Jean Fromentin, Luis Paris
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
Recommendations
Symbolic computation and algebraic computation (68W30) Braid groups; Artin groups (20F36) Ordered semigroups and monoids (06F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Free semigroups, generators and relations, word problems (20M05) Software, source code, etc. for problems pertaining to group theory (20-04)
Cites Work
- Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
- A new approach to the word and conjugacy problems in the braid groups
- A fast method for comparing braids
- Alternating normal forms for braids and locally Garside monoids.
- THE BRAID GROUP AND OTHER GROUPS
- Braid Groups and Left Distributive Operations
- On the complexity of braids.
- The wellordering on positive braids
- Ordering the braid groups
- A NORMAL FORM FOR BRAIDS
- The well-ordering of dual braid monoid.
- Left-distributive idempotent algebras
- A well-ordering of dual braid monoids.
Cited In (3)
This page was built for publication: A simple algorithm for finding short sigma-definite representatives.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q420741)