arXiv Analytics

Sign in

arXiv:0903.3751 [math.GR]AbstractReferencesReviewsResources

The Conjugacy Problem in Amalgamated Products I: Regular Elements and Black Holes

Alexandre V. Borovik, Alexei G. Myasnikov, Vladimir N. Remeslennikov

Published 2009-03-22Version 1

We discuss the time complexity of the word and conjugacy search problems for free products $G = A \star_C B$ of groups $A$ and $B$ with amalgamation over a subgroup $C$. We stratify the set of elements of $G$ 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 groups $A,B,C$.

Categories: math.GR
Subjects: 20F10, 20P05
Related articles: Most relevant | Search more
arXiv:0903.3754 [math.GR] (Published 2009-03-22)
Generic complexity of the Conjugacy Problem in HNN-extensions and algorithmic stratification of Miller's groups
arXiv:2309.16613 [math.GR] (Published 2023-09-28)
Conjugacy in Rearrangement Groups of Fractals
arXiv:2209.04357 [math.GR] (Published 2022-09-09)
The Conjugacy Problem for ascending HNN-extensions of free groups

Links

Toolbox