Braid Groups and Left Distributive Operations

Author:
  • PDPatrick Dehornoy
    Patrick Dehornoy

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.

This publication has 14 references indexed in Scilit: