A simple algorithm for finding short sigma-definite representatives
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 sigmai with maximal index i appears either only positively or only negatively.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.