Positive permutation braids on n strings, which are defined to be positive n-braids where each pair of strings crosses at most once, form the elementary but non-trivial building blocks in many studies of conjugacy in the braid groups. We consider conjugacy among these elementary braids which close to knots, and show that those which close to the trivial knot or to the trefoil are all conjugate. All such n-braids with the maximum possible crossing number are also shown to be conjugate. We note that conjugacy of these braids for n ≤ 5 depends only on the crossing number. In contrast, we exhibit two such braids on 6 strings with 9 crossings which are not conjugate but whose closures are each isotopic to the (2,5) torus knot.
@article{bwmeta1.element.bwnjournal-article-doi-10_4064-fm188-0-8,
author = {Hugh R. Morton and Richard J. Hadji},
title = {Conjugacy for positive permutation braids},
journal = {Fundamenta Mathematicae},
volume = {185},
year = {2005},
pages = {155-166},
zbl = {1086.57007},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-fm188-0-8}
}
Hugh R. Morton; Richard J. Hadji. Conjugacy for positive permutation braids. Fundamenta Mathematicae, Tome 185 (2005) pp. 155-166. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-fm188-0-8/