Magnus embedding and algorithmic properties of groups 𝐹/𝑁^{(𝑑)}-Reference-Cited by-同舟云学术

Magnus embedding and algorithmic properties of groups 𝐹/𝑁^{(𝑑)}

Published:2016-11-28 Issue:9 Volume:369 Page:6189-6206
ISSN:0002-9947
Container-title:Transactions of the American Mathematical Society
language:en
Short-container-title:Trans. Amer. Math. Soc.

Author:

Gul Funda,Sohrabi Mahmood,Ushakov Alexander

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 ) 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.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/tran/2017-369-09/S0002-9947-2016-06880-4/S0002-9947-2016-06880-4.pdf

Reference21 articles.

1. On the word problem and the conjugacy problem for groups of the form 𝐹/𝑉(𝑅);Anokhin, M. I.;Mat. Zametki,1997

2. Commutator subgroups of free groups;Auslander, Maurice;Amer. J. Math.,1955

3. Limit groups as limits of free groups;Champetier, Christophe;Israel J. Math.,2005

4. L. Frenkel, A. Nikolaev, and A. Ushakov, Knapsack problems in products of groups, preprint, arXiv:1408.6509, 2014.

5. On the conjugacy problem for 𝐹/𝑅′;Gupta, C. K.;Proc. Amer. Math. Soc.,1982

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Orientable quadratic equations in free metabelian groups;Journal of Algebra;2021-09

2. A Characterization of Wreath Products Where Knapsack Is Decidable;LEIBNIZ INT PR INFOR;2021

3. The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC0;Theory of Computing Systems;2018-02-12