Conjugacy problem for braid groups and Garside groups

被引:50
|
作者
Franco, N
González-Meneses, J
机构
[1] Univ Sevilla, ETS Arquitectura, Dept Matemat Aplicada 1, E-41012 Seville, Spain
[2] Univ Evora, CIMS, Dept Matemat, P-7000 Evora, Portugal
[3] Univ Bourgogne, UMR 5584 CNRS, Lab Topol, F-21078 Dijon, France
关键词
braid groups; Artin groups; garside groups; small Gaussian groups; conjugacy problem;
D O I
10.1016/S0021-8693(03)00292-8
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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.
引用
收藏
页码:112 / 132
页数:21
相关论文
共 50 条