A simple algorithm for finding short sigma-definite representatives.

DOI10.1016/j.jalgebra.2011.09.039zbMath1243.20049arXiv1101.1400OpenAlexW2963284565MaRDI QIDQ420741

Luis Paris, Jean Fromentin

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

zbMATH Keywords

algorithmsbraid groupsnormal form theoremsbraid monoidsbraid orderings

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) 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) Software, source code, etc. for problems pertaining to group theory (20-04) Ordered semigroups and monoids (06F05)

Related Items (3)

The rotating normal form of braids is regular ⋮ The braid shelf ⋮ Ordering Garside groups

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

This page was built for publication: A simple algorithm for finding short sigma-definite representatives.