arXiv Analytics

Sign in

arXiv:0906.0137 [math.GR]AbstractReferencesReviewsResources

Complexity of relations in the braid group

Joel Hass, Arkadius Kalka, Tahl Nowik

Published 2009-05-31Version 1

We show that for any given n, there exists a sequence of words a_k in the generators sigma_1, ... sigma_{n-1} of the braid group B_n, representing the identity element of B_n, such that the number of braid relations of the form sigma_i sigma_{i+1} sigma_i = sigma_{i+1} sigma_i sigma_{i+1} needed to pass from a_k to the empty word is quadratic with respect to the length of a_k.

Related articles: Most relevant | Search more
arXiv:math/0603397 [math.GR] (Published 2006-03-16)
Braid Group of a Genetic Code
arXiv:math/0005038 [math.GR] (Published 2000-05-04)
Braid Groups are Linear
arXiv:1701.03631 [math.GR] (Published 2017-01-13)
Braid groups in handlebodies and corresponding Hecke algebras