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

2015/01/05 by Funda Gul, Gul, Funda, Mahmood Sohrabi +3 · 1 citation
Computer Science · Mathematics · #03D15 #20F10 #20F19 #20F65 #Cellular Automata and Applications #FOS: Mathematics #Geometric and Algebraic Topology #Group Theory (math.GR) #math.GR #msc:03D15 #msc:20F10 #msc:20F19 #msc:20F65 #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1501.01001

arxiv created 2015/01/05 · openalex publication_date 2015/01/05 · arxiv updated 2015/01/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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

Cited by

• The conjugacy problem in free solvable groups and wreath product of abelian groups is in TC⁰

Related

• Metric Behaviour of the Magnus Embedding
• Polynomially-bounded Dehn functions of groups
• Algorithmic and asymptotic properties of groups
• Topologie, théorie des groupes et problèmes de décision. Célébration d'un article de Max Dehn de 1910
• Taming the hydra: the word problem and extreme integer compression