The Conjugacy Problem and Higman Embeddings
نویسندگان
چکیده
For 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.
منابع مشابه
The Conjugacy Problem for Groups, and Higman Embeddings
For 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.
متن کاملThe Farahat-higman Ring of Wreath Products and Hilbert Schemes
We study the structure constants of the class algebra RZ(Γn) of the wreath products Γn associated to an arbitrary finite group Γ with respect to a basis provided by the conjugacy classes. A suitable filtration on the RZ(Γn) gives rise to the rings GΓ(n) with non-negative integer structure constants independent of n, which are then encoded in a single (Farahat-Higman) ring GΓ. We establish vario...
متن کاملTuring Degrees and the Word and Conjugacy Problems for Finitely Presented Groups
The unsolvability of the conjugacy problem for finitely presented groups was first shown by Novikov [26]. Shortly thereafter the corresponding result for the word problem was proved by Novikov [27] and Boone [6] (see also Boone [7], Higman [20] and Britton [9]). Friedberg [19] and Mucnik [25] revitalised the theory of recursively enumerable (r.e.) Turing degrees by showing that there are degree...
متن کاملThe Conjugacy Problem in Wreath Products and Free Metabelian Groups
1. Introduction. The conjugacy problem was formulated by Dehn in 1912 for finitely presented groups [1]. The question was whether it can be effectively determined for such a group when two elements are conjugate. This general question was answered in the negative by Novikov in 1954 [6J. But it is still of interest to determine whether the problem is solvable for particular finitely presented gr...
متن کاملAlgorithmic and asymptotic properties of groups
This is a survey of the recent work in algorithmic and asymptotic properties of groups. I discuss Dehn functions of groups, complexity of the word problem, Higman embeddings, and constructions of finitely presented groups with extreme properties (monsters). Mathematics Subject Classification (2000). Primary 20F65; Secondary 20F10.
متن کامل