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 language | English |
|---|---|
| Pages (from-to) | 1299-1333 |
| Number of pages | 35 |
| Journal | International Journal of Algebra and Computation |
| Volume | 17 |
| Issue number | 7 |
| DOIs | |
| State | Published - 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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver