The Conjugacy Problem and Higman Embeddings

Simple item page
dc.creatorOlshanskii, A. Yu.
dc.creatorSapir, M. V.
dc.date2002-12-17
dc.date.accessioned2026-07-07T04:53:50Z
dc.date.available2026-07-07T04:53:50Z
dc.descriptionFor every finitely generated recursively presented group G we construct a finitely presented group H containing G such that G is (Frattini) embedded into H and the group H has solvable conjugacy problem if and only if G has solvable conjugacy problem. Moreover G and H have the same r.e. Turing degrees of the conjugacy problem. This solves a problem by D. Collins.
dc.identifierhttps://arxiv.org/abs/math/0212227
dc.identifierhttp://arxiv.org/abs/math/0212227
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/66012
dc.subjectGroup Theory
dc.subjectLogic
dc.titleThe Conjugacy Problem and Higman Embeddings
dc.typetext

Files

Collections

arXiv