𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Conjugacy of braids

✍ Scribed by V. B. Styshnev

Publisher
SP MAIK Nauka/Interperiodica
Year
1990
Tongue
English
Weight
305 KB
Volume
47
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Conjugacy Search in Braid Groups
Conjugacy Search in Braid Groups
✍ Volker Gebhardt πŸ“‚ Article πŸ“… 2006 πŸ› Springer 🌐 English βš– 261 KB
Conjugacy problem for braid groups and G
Conjugacy problem for braid groups and Garside groups
✍ Nuno Franco; Juan GonzΓ‘lez-Meneses πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 211 KB

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 an

The Infimum, Supremum, and Geodesic Leng
The Infimum, Supremum, and Geodesic Length of a Braid Conjugacy Class
✍ Joan S. Birman; Ki Hyoung Ko; Sang Jin Lee πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 154 KB

Algorithmic solutions to the conjugacy problem in the braid groups B n , n=2, 3, 4, ... were given in earlier work. This note concerns the computation of two integer class invariants, known as ''inf'' and ''sup.'' A key issue in both algorithms is the number m of times one must ''cycle'' (resp. ''de

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