Conjugacy problem for braid groups and Garside groups

Details Conjugacy problem for braid groups and Garside groups Conjugacy problem for braid groups and Garside groups

2001-12-30

arxiv.org/abs/math/0112310v2

Mathematics

Geometric Topology

New version, with substantial modifications. 21 pages, 2 figures

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

Conjugacy problem for braid groups and Garside groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Conjugacy problem for braid groups and Garside groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Conjugacy problem for braid groups and Garside groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-457681