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 language | English |
---|---|
Pages (from-to) | 6189-6206 |
Number of pages | 18 |
Journal | Transactions of the American Mathematical Society |
Volume | 369 |
Issue number | 9 |
DOIs | |
State | Published - 2017 |
Keywords
- Conjugacy problem
- Free solvable groups
- Magnus embedding
- Power problem
- Word problem