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). (C) 2003 Elsevier Inc. All rights reserved.
机构:
Univ Michigan, Dept Computat Med & Bioinformat, Ann Arbor, MI 48109 USAUniv Michigan, Dept Computat Med & Bioinformat, Ann Arbor, MI 48109 USA
Gryak, Jonathan
Kahrobaei, Delaram
论文数: 0引用数: 0
h-index: 0
机构:
CUNY, CUNY Grad Ctr, PhD Program Comp Sci, New York, NY 10021 USA
CUNY, NYCCT, Math Dept, New York, NY 10021 USAUniv Michigan, Dept Computat Med & Bioinformat, Ann Arbor, MI 48109 USA
Kahrobaei, Delaram
Martinez-Perez, Conchita
论文数: 0引用数: 0
h-index: 0
机构:
Univ Zaragoza, Dept Math, Zaragoza, SpainUniv Michigan, Dept Computat Med & Bioinformat, Ann Arbor, MI 48109 USA