Group Embeddings with Algorithmic Properties
Group Theory
2017-08-16 v1 Logic
Abstract
We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We also give estimates of time and space complexity of the word problem in G and of the membership problem for H < G.
Cite
@article{arxiv.1708.04397,
title = {Group Embeddings with Algorithmic Properties},
author = {Arman Darbinyan},
journal= {arXiv preprint arXiv:1708.04397},
year = {2017}
}