Solution of the quasipositivity problem in the braid group

Simple item page
dc.creatorBentalha, Asma
dc.date2004-02-02
dc.date2004-03-31
dc.date.accessioned2026-07-07T05:05:03Z
dc.date.available2026-07-07T05:05:03Z
dc.descriptionWe 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.
dc.description20 pages.Revised version of march 2004
dc.identifierhttps://arxiv.org/abs/math/0402023
dc.identifierhttp://arxiv.org/abs/math/0402023
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/70037
dc.subjectGeometric Topology
dc.subjectCombinatorics
dc.subject05E15
dc.titleSolution of the quasipositivity problem in the braid group
dc.typetext

Files

Collections

arXiv