𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Conjugacy problem for braid groups and Garside groups

✍ Scribed by Nuno Franco; Juan González-Meneses

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
211 KB
Volume
266
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

A New Approach to the Word and Conjugacy
A New Approach to the Word and Conjugacy Problems in the Braid Groups
✍ Joan Birman; Ki Hyoung Ko; Sang Jin Lee 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 638 KB

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

On complexity of the word problem in bra
On complexity of the word problem in braid groups and mapping class groups
✍ Hessam Hamidi-Tehrani 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 350 KB

We prove that the word problem in the mapping class group of the once-punctured surface of genus g has complexity O(|w| 2 g) for |w| log(g) where |w| is the length of the word in a (standard) set of generators. The corresponding bound in the case of the closed surface is O(|w| 2 g 2 ). We also carry