Title of article
Conjugacy problem for braid groups and Garside groups
Author/Authors
Nuno Franco، نويسنده , , Juan Gonz?lez-Meneses، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
21
From page
112
To page
132
Abstract
We present a new algorithm to solve the conjugacy problem in Artin braid groups, which is faster than the one presented by Birman, Ko, and Lee [Adv. Math. 139 (1998) 322–353]. This algorithm can be applied not only to braid groups, but to all Garside groups (which include finite type Artin groups and torus knot groups among others).
Keywords
Conjugacy problem , Small Gaussian groups , braid groups , Artin groups , Garside groups
Journal title
Journal of Algebra
Serial Year
2003
Journal title
Journal of Algebra
Record number
696292
Link To Document