Conjugacy problem for braid groups and Garside groups. (Q1403868)

The authors present a new algorithm to solve the conjugacy problem in Artin braid groups, which is faster than the one presented by \textit{J. Birman}, \textit{K. H. Ko} and \textit{S. J. Lee} [Adv. Math. 139, No. 2, 322-353 (1998; Zbl 0937.20016)]. 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).