
For every finitely generated recursively presented group G {\mathcal G} we construct a finitely presented group H {\mathcal H} containing G {\mathcal G} such that G {\mathcal G} is (Frattini) embedded into H {\mathcal H} and the group H {\mathcal H} has solvable conjugacy problem if and only if G {\mathcal G} has solvable conjugacy problem. Moreover, G {\mathcal G} and H {\mathcal H} have the same r.e. Turing degrees of the conjugacy problem. This solves a problem by D. Collins.
Generators, relations, and presentations of groups, solvable conjugacy problem, Frattini embeddings, Subgroup theorems; subgroup growth, finitely generated recursively presented groups, Turing degrees, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Word problems, etc. in computability and recursion theory
Generators, relations, and presentations of groups, solvable conjugacy problem, Frattini embeddings, Subgroup theorems; subgroup growth, finitely generated recursively presented groups, Turing degrees, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Word problems, etc. in computability and recursion theory
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
