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

来源：

JOURNAL OF ALGEBRA | 2003年 / 266卷 / 01期

关键词：

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

共 16 条

[1] Anshel I, 1999, MATH RES LETT, V6, P287
[2] THEORY OF BRAIDS
ARTIN, E
[J]. ANNALS OF MATHEMATICS, 1947, 48 (01) : 101 - 125
[3] A new approach to the word and conjugacy problems in the braid groups
Birman, J
Ko, KH
Lee, SJ
[J]. ADVANCES IN MATHEMATICS, 1998, 139 (02) : 322 - 353
[4] BIRMAN J, 2000, INFIMUM SUPREMUM GEO
[5] BOURBAKI N, 1968, GROUPES ALGEBRES LIE, pCHR4
[6] ARTIN GROUPS AND COXETER GROUPS
BRIESKORN, E
SAITO, K
[J]. INVENTIONES MATHEMATICAE, 1972, 17 (04) : 245 - +
[7] ARTIN GROUPS OF FINITE-TYPE ARE BIAUTOMATIC
CHARNEY, R
[J]. MATHEMATISCHE ANNALEN, 1992, 292 (04) : 671 - 683
[8] Gaussian groups and Garside groups, two generalisations of Artin groups
Dehornoy, P
Paris, L
[J]. PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 1999, 79 : 569 - 604
[9] Garside groups
Dehornoy, P
[J]. ANNALES SCIENTIFIQUES DE L ECOLE NORMALE SUPERIEURE, 2002, 35 (02): : 267 - 306
[10] ALGORITHMS FOR POSITIVE BRAIDS
ELRIFAI, EA
MORTON, HR
[J]. QUARTERLY JOURNAL OF MATHEMATICS, 1994, 45 (180) : 479 - 497

← 1 2 →