6533b86ffe1ef96bd12ce95a
RESEARCH PRODUCT
Conjugacy problem for braid groups and Garside groups
Nuno FrancoNuno FrancoJuan González-menesessubject
Conjugacy problemBraid group20F36Geometric topologyGarside groupsGroup Theory (math.GR)0102 computer and information sciencesAlgebraic topology01 natural sciencesTorus knotCombinatoricsMathematics - Geometric TopologyMathematics::Group TheoryMathematics::Quantum AlgebraFOS: MathematicsAlgebraic Topology (math.AT)Mathematics - Algebraic Topology0101 mathematics20F36; 20F10MathematicsSmall Gaussian groupsAlgebra and Number Theory010102 general mathematicsConjugacy problemBraid groupsGeometric Topology (math.GT)Braid theoryMathematics::Geometric TopologyArtin groups010201 computation theory & mathematicsArtin group20F10Mathematics - Group TheoryGroup theorydescription
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).
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2003-08-01 |