A simple algorithm for finding short sigma-definite representatives
arXiv:1101.1400
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.
11 pages