Solution of the quasipositivity problem in the braid group
Abstract
Description
We give a computational algorithm which decides if a braid is quasipositive or not. A braid is quasipositive if it's a product of conjuguates of generators. For this, we use the theory of Garside and the combinatorials properties of the Artin monoid.
20 pages.Revised version of march 2004
20 pages.Revised version of march 2004