Abstract

We show that the conjugacy problem in a wreath product \(A \wr B\) is uniform-\({{\mathsf {T}}}{{\mathsf {C}}}^0\)-Turing-reducible to the conjugacy problem in the factors A and B and the power problem in B. Moreover, if B is torsion free, the power problem for B can be replaced by the slightly weaker cyclic submonoid membership problem for B, which itself turns out to be uniform-\({{\mathsf {T}}}{{\mathsf {C}}}^0\)-Turing-reducible to the conjugacy problem in \(A \wr B\) if A is non-abelian.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.