Conjugacy problem for braid groups and Garside groups

2001/12/30 by Nuno Franco, Franco, Nuno, Juan González-Meneses +2
Mathematics · #Geometric and Algebraic Topology #math.AT #math.GR #math.GT #msc:20F10 #msc:20F36

paper · pdf · doi:10.48550/arxiv.math/0112310

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

arxiv created 2002/08/28 · arxiv updated 2009/11/30

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

Related

• Conjugacy in Garside Groups III: Periodic braids
• Complete simultaneous conjugacy invariants in Artin's braid groups
• A fast solution to the conjugacy problem in the 4-strand braid group
• Conjugacy problem for subgroups with applications to Artin groups and braid type groups
• Conjugacy classes of periodic braids