Conjugacy problem for braid groups and Garside groups
classification
🧮 math.GT
math.ATmath.GR
keywords
groupsbraidalgorithmartinconjugacygarsideproblemapplied
read the original abstract
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).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.