Magnus embedding and algorithmic properties of groups $F/N^{(d)}$
Group Theory
2015-01-07 v1
Abstract
In this paper we further study properties of Magnus embedding, give a precise reducibility diagram for Dehn problems in groups of the form , and provide a detailed answer to Problem 12.98 in Kourovka notebook. We also show that most of the reductions are polynomial time reductions and can be used in practical computation.
Keywords
Cite
@article{arxiv.1501.01001,
title = {Magnus embedding and algorithmic properties of groups $F/N^{(d)}$},
author = {Funda Gul and Mahmood Sohrabi and Alexander Ushakov},
journal= {arXiv preprint arXiv:1501.01001},
year = {2015}
}