arXiv:math/0112310 Abstract

arXiv:math/0112310 [math.GT]Abstract References Reviews Resources

Conjugacy problem for braid groups and Garside groups

Published 2001-12-30, updated 2002-08-28Version 2

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. 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).

Comments: New version, with substantial modifications. 21 pages, 2 figures

Categories: math.GT, math.AT, math.GR

Subjects: 20F36, 20F10

Keywords: garside groups, conjugacy problem, finite type artin groups, torus knot groups, artin braid groups

Related articles: Most relevant | Search more

arXiv:math/0201243 [math.GT] (Published 2002-01-25, updated 2002-12-10)

Computation of Centralizers in Braid groups and Garside Groups

Nuno Franco, Juan Gonzalez-Meneses

arXiv:math/0611454 [math.GT] (Published 2006-11-15, updated 2006-12-05)

A fast algorithm to the conjugacy problem on generic braids

Ki Hyoung Ko, Jang Won Lee

arXiv:0711.0091 [math.GT] (Published 2007-11-01, updated 2009-06-18)