A New Approach to the Word and Conjugacy Problems in the Braid Groups
Source: Advances in Mathematics, Volume 139, Number 2, November 1998 , pp. 322-353(32)
Publisher: Academic Press
Abstract:A new presentation of the n-string braid group Bn is studied. Using it, a new solution to the word problem in Bn is obtained which retains most of the desirable features of the Garside–Thurston solution, and at the same time makes possible certain computational improvements. We also give a related solution to the conjugacy problem, but the improvements in its complexity are not clear at this writing. Copyright 1998 Academic Press.
Document Type: Research Article
Publication date: November 1998