The Conjugacy Problem and Higman Embeddings

Details The Conjugacy Problem and Higman Embeddings The Conjugacy Problem and Higman Embeddings

2002-12-17

arxiv.org/abs/math/0212227v1

Mathematics

Group Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Conjugacy Problem and Higman Embeddings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Conjugacy Problem and Higman Embeddings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Conjugacy Problem and Higman Embeddings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-259473