Magnus embedding and algorithmic properties of groups $F/N^{(d)}$

preprint2015arXivOpen access

In this paper we further study properties of Magnus embedding, give a precise reducibility diagram for Dehn problems in groups of the form $F/N^{(d)}$ , 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Magnus embedding and algorithmic properties of groups $F/N^{(d)}$

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

Magnus embedding and algorithmic properties of groups F/N(d)F/N^{(d)}F/N(d)

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

Magnus embedding and algorithmic properties of groups $F/N^{(d)}$