Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Note on the Shifted Conjugacy Problem in Braid Groups

A Note on the Shifted Conjugacy Problem in Braid Groups It is an open problem whether the shifted conjugacy (decision) problem in B ∞ is solvable. We settle this problem by reduction to an instance of the simultaneous conjugacy problem in B n for some n ∈ ℕ. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups - Complexity - Cryptology de Gruyter

A Note on the Shifted Conjugacy Problem in Braid Groups

Loading next page...
 
/lp/de-gruyter/a-note-on-the-shifted-conjugacy-problem-in-braid-groups-ctkodO6HjC
Publisher
de Gruyter
Copyright
© Heldermann Verlag
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/GCC.2009.227
Publisher site
See Article on Publisher Site

Abstract

It is an open problem whether the shifted conjugacy (decision) problem in B ∞ is solvable. We settle this problem by reduction to an instance of the simultaneous conjugacy problem in B n for some n ∈ ℕ.

Journal

Groups - Complexity - Cryptologyde Gruyter

Published: Oct 1, 2009

There are no references for this article.