Reducible braids and Garside theory

Details Reducible braids and Garside theory Reducible braids and Garside theory

2010-08-02

arxiv.org/abs/1008.0238v1

Mathematics

Geometric Topology

28 pages, 4 figures

Scientific paper

We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its conjugacy class which we call the stabilized set of sliding circuits, and if it is reducible, then its reducibility is geometrically obvious: it has a round or almost round reducing curve. Moreover, for any given braid, an element of its stabilized set of sliding circuits can be found using the well-known cyclic sliding operation. This leads to a polynomial time algorithm for deciding the Nielsen-Thurston type of any braid, modulo one well-known conjecture on the speed of convergence of the cyclic sliding operation.

Affiliated with

Also associated with

No associations

Rating

Reducible braids and Garside theory 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 Reducible braids and Garside theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reducible braids and Garside theory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-52545