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

Simple item page
dc.creatorBorovik, Alexandre V.
dc.creatorMyasnikov, Alexei G.
dc.creatorRemeslennikov, Vladimir N.
dc.date2009-03-22
dc.date.accessioned2026-07-07T12:55:35Z
dc.date.available2026-07-07T12:55:35Z
dc.descriptionWe 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$.
dc.identifierhttps://arxiv.org/abs/0903.3751
dc.identifierhttp://arxiv.org/abs/0903.3751
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/224300
dc.subjectGroup Theory
dc.subject20F10 (Primary), 20P05 (Secondary)
dc.titleThe Conjugacy Problem in Amalgamated Products I: Regular Elements and Black Holes
dc.typetext

Files

Collections

arXiv