Log-space complexity of the conjugacy problem in wreath products

Alexei Myasnikov, Svetla Vassileva, Armin Weiss

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

1 Scopus citations

Abstract

We show a transfer result from individual groups to wreath products. Namely, we prove that the conjugacy problem in the wreath product AB of two groups A and B is log-space decidable, provided the factor groups A and B both have log-space decidable conjugacy problem and B has log-space computable power problem. If, additionally, A and B have bounded torsion and A has log-space computable power problem, we show that the iterated wreath product AnB also has log-space decidable conjugacy problem. We apply these general results to show that free solvable groups and wreath products of two abelian groups (in particular, the lamplighter group, Z2 = Z) have log-space decidable conjugacy problem.

Original languageEnglish
Title of host publicationInfinite Group Theory
Subtitle of host publicationFrom The Past To The Future
Pages215-236
Number of pages22
ISBN (Electronic)9789813204058
StatePublished - 26 Dec 2017

Fingerprint

Dive into the research topics of 'Log-space complexity of the conjugacy problem in wreath products'. Together they form a unique fingerprint.

Cite this