A simple algorithm for finding short sigma-definite representatives
Group Theory
2011-01-10 v1
Abstract
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.
Cite
@article{arxiv.1101.1400,
title = {A simple algorithm for finding short sigma-definite representatives},
author = {Jean Fromentin and Luis Paris},
journal= {arXiv preprint arXiv:1101.1400},
year = {2011}
}
Comments
11 pages