Conjugacy problem for braid groups and Garside groups

Simple item page
dc.creatorFranco, Nuno
dc.creatorGonzalez-Meneses, Juan
dc.date2001-12-30
dc.date2002-08-28
dc.date.accessioned2026-07-07T04:45:36Z
dc.date.available2026-07-07T04:45:36Z
dc.descriptionWe 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).
dc.descriptionNew version, with substantial modifications. 21 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/math/0112310
dc.identifierhttp://arxiv.org/abs/math/0112310
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/63010
dc.subjectGeometric Topology
dc.subjectAlgebraic Topology
dc.subjectGroup Theory
dc.subject20F36; 20F10
dc.titleConjugacy problem for braid groups and Garside groups
dc.typetext

Files

Collections

arXiv