Solution of the quasipositivity problem in the braid group

2004/02/02 by Asma Bentalha, Bentalha, Asma
Mathematics · #05E15 #Combinatorics (math.CO) #FOS: Mathematics #Geometric Topology (math.GT) #math.CO #math.GT #msc:05E15

paper · pdf · doi:10.48550/arxiv.math/0402023

20 pages.Revised version of march 2004

arxiv created 2004/03/31 · arxiv updated 2009/12/01

Abstract

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.

Related

• Quasi-positivity and recognition of products of conjugacy classes in free groups
• Conjugacy problem for braid groups and Garside groups
• Strongly quasipositive links with braid index 3 have positive Conway polynomial
• A Faithful Representation of the Singular Braid Monoid on Three Strands
• Almost all strongly quasipositive braid closures are fibered