Conjugacy problem for braid groups and G
β
Nuno Franco; Juan GonzΓ‘lez-Meneses
π
Article
π
2003
π
Elsevier Science
π
English
β 211 KB
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 an