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

Learn More →

Polynomial time conjugacy in wreath products and free solvable groups

Polynomial time conjugacy in wreath products and free solvable groups Abstract We prove that the complexity of the conjugacy problems for wreath products and for free solvable groups is decidable in polynomial time. For the wreath product A wr B , we must assume the decidability in polynomial time of the conjugacy problems for A and B and of the power problem in B . Using this result and properties of the Magnus embedding, we show that the conjugacy and conjugacy search problems in free solvable groups are computable in polynomial time. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups - Complexity - Cryptology de Gruyter

Polynomial time conjugacy in wreath products and free solvable groups

Groups - Complexity - Cryptology , Volume 3 (1) – May 1, 2011

Loading next page...
 
/lp/de-gruyter/polynomial-time-conjugacy-in-wreath-products-and-free-solvable-groups-8SGVnhiq4X
Publisher
de Gruyter
Copyright
Copyright © 2011 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc.2011.005
Publisher site
See Article on Publisher Site

Abstract

Abstract We prove that the complexity of the conjugacy problems for wreath products and for free solvable groups is decidable in polynomial time. For the wreath product A wr B , we must assume the decidability in polynomial time of the conjugacy problems for A and B and of the power problem in B . Using this result and properties of the Magnus embedding, we show that the conjugacy and conjugacy search problems in free solvable groups are computable in polynomial time.

Journal

Groups - Complexity - Cryptologyde Gruyter

Published: May 1, 2011

There are no references for this article.