Borovik, Alexandre and Myasnikov, Alexei G. and Remeslennikov, Vladimir V. (2006) The Conjugacy Problem in Amalgamated Products I: Regular Elements and Black Holes. [MIMS Preprint]
![[thumbnail of amalgam_Ie.pdf]](https://eprints.maths.manchester.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
amalgam_Ie.pdf Download (371kB) |
Abstract
We discuss the time complexity of the word and conjugacy problems for free products of two groups with amalgamation over a subgroup. We stratify the set of elements of the fre product with respect to the complexity of the word and conjugacy problems and show that for the generic stratum the conjugacy search problem is decidable under some reasonable assumptions about the groups groups involved. Moreover, the decision algorithm is fast on the generic stratum.
| Item Type: | MIMS Preprint |
|---|---|
| Uncontrolled Keywords: | free product with amalgamation, decision product, complexity, conjugacy |
| Subjects: | MSC 2010, the AMS's Mathematics Subject Classification > 20 Group theory and generalizations |
| Depositing User: | Prof Alexandre Borovik |
| Date Deposited: | 16 Feb 2006 |
| Last Modified: | 05 Jan 2018 19:22 |
| URI: | https://eprints.maths.manchester.ac.uk/id/eprint/113 |
Actions (login required)
 |
View Item |