2006.14: The Conjugacy Problem in Amalgamated Products I: Regular Elements and Black Holes
2006.14: Alexandre V. Borovik, Alexei G. Myasnikov and Vladimir V. Remeslennikov (2006) The Conjugacy Problem in Amalgamated Products I: Regular Elements and Black Holes.
Full text available as:
|PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
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 2000 > 20 Group theory and generalizations|
|Deposited By:||Prof Alexandre Borovik|
|Deposited On:||16 February 2006|