A new approach to the word and conjugacy problems in the braid groups

被引：223

作者：

Birman, J ^{[1
]}

Ko, KH

Lee, SJ

机构：

[1] Columbia Univ, Dept Math, New York, NY 10027 USA

[2] Columbia Univ Barnard Coll, New York, NY 10027 USA

[3] Korea Adv Inst Sci & Technol, Dept Math, Taejon 305701, South Korea

来源：

ADVANCES IN MATHEMATICS | 1998年 / 139卷 / 02期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1006/aima.1998.1761

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A new presentation of the n-string braid group B-n is studied. Using it, a new solution to the word problem in B-n is obtained which retains most of the desirable features of the Garside-Thurston solution, and at the same time makes possible certain computational improvements. We also give a related solution to the conjugacy problem, hut the improvements in its complexity are not clear at this writing. (C) 1998 Academic Press.

引用

页码：322 / 353

页数：32

共 17 条

[1]

ADJAN S, 1966, P STEKLOV I MATH, V85

[2]

Aho A.V., 1974, The Design and Analysis of Computer Algorithms

[3]

Artin Emil, 1926, Abh. Math. Semin. Univ. Hamb, V4, P47, DOI DOI 10.1007/BF02950718

[4] STUDYING LINKS VIA CLOSED BRAIDS .3. CLASSIFYING LINKS WHICH ARE CLOSED 3-BRAIDS [J].