A polynomial-time solution to the reducibility problem

Details A polynomial-time solution to the reducibility problem A polynomial-time solution to the reducibility problem

2006-10-25

arxiv.org/abs/math/0610746v3

Mathematics

Geometric Topology

13 pages, 7 figures

Scientific paper

We propose an algorithm for deciding whether a given braid is pseudo-Anosov,
reducible, or periodic. The algorithm is based on Garside's weighted
decomposition and is polynomial-time in the word-length of an input braid.
Moreover, a reduction system of circles can be found completely if the input is
a certain type of reducible braids.

Affiliated with

Also associated with

No associations

Rating

A polynomial-time solution to the reducibility problem 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 A polynomial-time solution to the reducibility problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A polynomial-time solution to the reducibility problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-378609