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
Théorie des groupes [math.GR]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...