Polynomial time conjugacy in wreath products and free solvable groups

Details Polynomial time conjugacy in wreath products and free solvable groups Polynomial time conjugacy in wreath products and free solvable groups

2010-11-26

arxiv.org/abs/1011.5931v1

Mathematics

Group Theory

Scientific paper

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 AwrB, we must assume the decidability in polynomial time of the Conjugacy Problems for A and B and of the power problem in B. We obtain the result by making the algorithm for the Conjugacy Problem described in a paper of Matthews run in polynomial time. 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.

Affiliated with

Also associated with

No associations

Rating

Polynomial time conjugacy in wreath products and free solvable groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Polynomial time conjugacy in wreath products and free solvable groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial time conjugacy in wreath products and free solvable groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-589020