A new approach to the word and conjugacy problems in the braid groups
Geometric Topology
2007-05-23 v2
Abstract
A new presentation of the -string braid group is studied. Using it, a new solution to the word problem in is obtained which retains most of the desirable features of the Garside-Thurston solution, and at the same time makes possible certain computational improvements. We also give a related solution to the conjugacy problem, but the improvements in its complexity are not clear at this writing.
Keywords
Cite
@article{arxiv.math/9712211,
title = {A new approach to the word and conjugacy problems in the braid groups},
author = {Joan S. Birman and K. H. Ko and J. S. Lee},
journal= {arXiv preprint arXiv:math/9712211},
year = {2007}
}
Comments
This updated version of "A new approach to the word problem in the braid groups" contains a new section on the conjugacy problem. 31 pages