A simple algorithm for finding short sigma-definite representatives

We describe a new algorithm which for each braid returns a quasi-geodesic σ-definite word representative, defined as a braid word in which the generator σi with maximal index i appears either only positively or only negatively.