TY - JOUR
T1 - The conjugacy problem in amalgamated products I
T2 - Regular elements and black holes
AU - Borovik, Alexandre V.
AU - Myasnikov, Alexei G.
AU - Remeslennikov, Vladimir N.
PY - 2007/11
Y1 - 2007/11
N2 - We discuss the time complexity of the word and conjugacy search problems for free products G = A *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.
AB - We discuss the time complexity of the word and conjugacy search problems for free products G = A *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.
KW - Amalgamated problem
KW - Conjugacy problem
KW - Group
UR - http://www.scopus.com/inward/record.url?scp=36549036657&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=36549036657&partnerID=8YFLogxK
U2 - 10.1142/S0218196707003652
DO - 10.1142/S0218196707003652
M3 - Article
AN - SCOPUS:36549036657
SN - 0218-1967
VL - 17
SP - 1299
EP - 1333
JO - International Journal of Algebra and Computation
JF - International Journal of Algebra and Computation
IS - 7
ER -