The Conjugacy Problem and Higman Embeddings
For every finitely generated recursively presented group $\mathcal G$ we construct a finitely presented group $\mathcal H$ containing $\mathcal G$ such that $\mathcal G$ is (Frattini) embedded into $\mathcal H$ and the group $\mathcal H$ has solvable conjugacy problem if and only if $\mathcal G$ has solvable conjugacy problem. Moreover $\mathcal G$ and $\mathcal H$ have the same r.e. Turing degrees of the conjugacy problem. This solves a problem by D. Collins.
133 pages
English edition · First published 2004 by American Mathematical Society · ISBN 9780821835135
Be the first to rate this book
Keep track of what you read
Book Nook is a free reading tracker with a 3D bookshelf, a reading timer, challenges with friends and a Reading Wrapped at the end of the year. Add The Conjugacy Problem and Higman Embeddings to your shelf in one tap.