A simple algorithm for finding short sigma-definite representatives.

DOI10.1016/J.JALGEBRA.2011.09.039MaRDI QIDQ420741zbMATHOpenAlexFDO

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

zbMATH Keywords

algorithmsbraid groupsnormal form theoremsbraid monoidsbraid orderings

Mathematics Subject Classification ID

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)

Abstract: We describe a new algorithm which for each braid returns a quasi-geodesic sigma-definite word representative, defined as a braid word in which the generator sigma_i with maximal index i appears either only positively or only negatively.

Recommendations

• Every braid admits a short sigma-definite expression.
• A fast method for comparing braids
• A new algorithm for solving the word problem in braid groups
• A NORMAL FORM FOR BRAIDS
• ALGORITHMS FOR POSITIVE BRAIDS

Cites work

• A NORMAL FORM FOR BRAIDS
• A fast method for comparing braids
• A new approach to the word and conjugacy problems in the braid groups
• A well-ordering of dual braid monoids.
• Alternating normal forms for braids and locally Garside monoids.
• Braid Groups and Left Distributive Operations
• Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
• Left-distributive idempotent algebras
• On the complexity of braids.
• Ordering the braid groups
• THE BRAID GROUP AND OTHER GROUPS
• The well-ordering of dual braid monoid.
• The wellordering on positive braids

Cited in

(3)

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

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)