Conjugacy problem for braid groups and Garside groups

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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. 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).
New version, with substantial modifications. 21 pages, 2 figures

Keywords

Geometric Topology, Algebraic Topology, Group Theory, 20F36; 20F10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/63010

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0112310
 http://arxiv.org/abs/math/0112310

Collections

arXiv