The Conjugacy Problem and Higman Embeddings
群论
2007-05-23 v1 逻辑
摘要
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.
引用
@article{arxiv.math/0212227,
title = {The Conjugacy Problem and Higman Embeddings},
author = {A. Yu. Olshanskii and M. V. Sapir},
journal= {arXiv preprint arXiv:math/0212227},
year = {2007}
}