An algorithm for the word problem in braid groups
Bert Wiest
Abstract
We suggest a new algorithm for finding a canonical representative of a given braid, and also for the harder problem of finding a σ1-consistent representative. We conjecture that the algorithm is quadratic-time. We present numerical evidence for this conjecture, and prove two results: (1) The algorithm terminates in finite time. (2) The conjecture holds in the special case of 3-string braids - in fact, we prove that the algorithm finds a minimal-lenght representative for any 3-string braid.
Create a lesson
Related papers
Combinatorial Goussarov-Polyak-Viro Formulas for the Linking Number and Low Degree Coefficients of the Conway Polynomial
Nancy Scherich, Nathaniel Song
The flip symmetry on Khovanov-Rozansky homology
Hongjian Yang
Families of knots that cannot be made Legendrian parametrically
Javier Martínez-Aguinaga
Branched real projective structures on surfaces and geometrisation of representations
Gianluca Faraco, Nicholas Rungi
Generating the twist subgroup of the level 2 mapping class group of a non-orientable closed surface
Ryoma Kobayashi
H-cobordisms, infinite cyclic covers, and real Seiberg--Witten theory
Sungkyung Kang, JungHwan Park, Masaki Taniguchi