Combinatorial distance between braid words

2009/06/20 by Patrick Dehornoy, Dehornoy, Patrick
Mathematics · #20F36 #FOS: Mathematics #Group Theory (math.GR) #math.GR #msc:20F36

paper · pdf · doi:10.48550/arxiv.0906.3814

arxiv created 2009/06/20 · arxiv updated 2009/12/01

Abstract

We give a simple naming argument for establishing lower bounds on the combinatorial distance between (positive) braid words.

Related

• Resolution depth of positive braids
• Braid Family Representatives
• A simple solution to the word problem for virtual braid groups
• An algorithm for the word problem in braid groups
• Complexity of relations in the braid group