A simple algorithm for finding short sigma-definite representatives
Résumé
We describe a new algorithm which for each braid returns a quasi-geodesic sigma-definite word representative, defined as a braid word in which the generator sigma_i with maximal index i appears either only positively or only negatively.
Domaines
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|---|
| Licence |
Loading...
![]()
Cite 10.1016/j.jalgebra.2011.09.039 Autre Fromentin, J., & Paris, L. (2012). A simple algorithm for finding short sigma-definite representatives. Journal of Algebra, 350(1), 405–415. https://doi.org/10.1016/j.jalgebra.2011.09.039