The conjugacy problem in amalgamated products I: Regular elements and black holes

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

Research output: Contribution to journalArticlepeer-review

17 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)1299-1333
Number of pages35
JournalInternational Journal of Algebra and Computation
Volume17
Issue number7
DOIs
StatePublished - Nov 2007

Keywords

  • Amalgamated problem
  • Conjugacy problem
  • Group

Fingerprint

Dive into the research topics of 'The conjugacy problem in amalgamated products I: Regular elements and black holes'. Together they form a unique fingerprint.

Cite this