✦ LIBER ✦

Conjugacy Search in Braid Groups

✍ Scribed by Volker Gebhardt

Publisher: Springer
Year: 2006
Tongue: English
Weight: 261 KB
Volume: 17
Category: Article
ISSN: 0938-1279
DOI: 10.1007/s00200-006-0008-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Term Rewriting for the Conjugacy Problem

Term Rewriting for the Conjugacy Problem and the Braid Groups

✍ John Pedersen; Margaret Yoder 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 312 KB

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

Conjugacy in polycyclic groups

✍ V. N. Remeslennikov 📂 Article 📅 1969 🏛 Springer US 🌐 English ⚖ 720 KB

Braid groups in genetic code

✍ V. G. Bardakov 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 260 KB

Conjugacy in semisimple algebraic groups

✍ Robert Steinberg 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 210 KB