2007/03/22 by Patrick Dehornoy, Dehornoy, Patrick
Mathematics · #20F36 #94A60 #FOS: Mathematics #Group Theory (math.GR) #math.GR #msc:20F36 #msc:94A60
paper · pdf · doi:10.48550/arxiv.math/0703666
arxiv created 2007/03/22 · arxiv updated 2009/12/01
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy problem, including the Dynnikov method, which could be especially suitable for cryptographical applications. Most results appear in literature; however, some results about the greedy normal form and the symmetric normal form and their connection with grid diagrams may have never been stated explicitly.