Solution of the quasipositivity problem in the braid group
几何拓扑
2007-05-23 v2 组合数学
摘要
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.
引用
@article{arxiv.math/0402023,
title = {Solution of the quasipositivity problem in the braid group},
author = {Asma Bentalha},
journal= {arXiv preprint arXiv:math/0402023},
year = {2007}
}
备注
20 pages.Revised version of march 2004