Braid Groups and Left Distributive Operations
Author:
- Patrick DehornoyPDPatrick Dehornoy
- 1 September 1994
- journal article
- Published by JSTOR in Transactions of the American Mathematical Society
- Vol. 345 (1) , 115-150
Abstract
The decidability of the word problem for the free left distributive law is proved by introducing a structure group which describes the underlying identities. This group is closely connected with Artin's braid group <!-- MATH ${B_\infty }$ --> . Braid colourings associated with free left distributive structures are used to show the existence of a unique ordering on the braids which is compatible with left translation and such that every generator <!-- MATH ${\sigma _i}$ --> is preponderant over all <!-- MATH ${\sigma _k}$ --> with i$">. This ordering is a linear ordering.
Keywords
This publication has 14 references indexed in Scilit:
- On braid words and irreflexivityAlgebra universalis, 1994
- ALGORITHMS FOR POSITIVE BRAIDSThe Quarterly Journal of Mathematics, 1994
- Critical points in an algebra of elementary embeddingsAnnals of Pure and Applied Logic, 1993
- Structural Monoids Associated to Equational VarietiesProceedings of the American Mathematical Society, 1993
- Problème de mots dans les gerbes libresTheoretical Computer Science, 1992
- The left distributive law and the freeness of an algebra of elementary embeddingsAdvances in Mathematics, 1992
- Free distributive groupoidsJournal of Pure and Applied Algebra, 1989
- Algebraic Properties of the Shift MappingProceedings of the American Mathematical Society, 1989
- A classifying invariant of knots, the knot quandleJournal of Pure and Applied Algebra, 1982
- THE BRAID GROUP AND OTHER GROUPSThe Quarterly Journal of Mathematics, 1969