𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Conjugacy problem in Metabelian groups

✍ Scribed by G. A. Noskov


Publisher
SP MAIK Nauka/Interperiodica
Year
1982
Tongue
English
Weight
558 KB
Volume
31
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Conjugacy problem for braid groups and G
✍ 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

Equations in free metabelian groups
✍ V. A. Roman'kov πŸ“‚ Article πŸ“… 1980 πŸ› SP MAIK Nauka/Interperiodica 🌐 English βš– 217 KB