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

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

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 The Kourovka notebook. We also show that most of the reductions are polynomial time reductions and can be used in practical computation.

Original languageEnglish
Pages (from-to)6189-6206
Number of pages18
JournalTransactions of the American Mathematical Society
Volume369
Issue number9
DOIs
StatePublished - 2017

Keywords

  • Conjugacy problem
  • Free solvable groups
  • Magnus embedding
  • Power problem
  • Word problem

Fingerprint

Dive into the research topics of 'Magnus embedding and algorithmic properties of groups F/N(d)'. Together they form a unique fingerprint.

Cite this