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

Funda Gul; Mahmood Sohrabi; Alexander Ushakov

doi:10.1090/tran/6880

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

Department of Mathematical Sciences

Stevens Institute of Technology

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	6189-6206
Number of pages	18
Journal	Transactions of the American Mathematical Society
Volume	369
Issue number	9
DOIs	https://doi.org/10.1090/tran/6880
State	Published - 2017

Keywords

Conjugacy problem
Free solvable groups
Magnus embedding
Power problem
Word problem

Access to Document

10.1090/tran/6880

Cite this

@article{44efc2f5f7174a259c8d625763d1d29a,

title = "Magnus embedding and algorithmic properties of groups F/N(d)",

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.",

keywords = "Conjugacy problem, Free solvable groups, Magnus embedding, Power problem, Word problem",

author = "Funda Gul and Mahmood Sohrabi and Alexander Ushakov",

note = "Publisher Copyright: {\textcopyright} 2016 American Mathematical Society.",

year = "2017",

doi = "10.1090/tran/6880",

language = "English",

volume = "369",

pages = "6189--6206",

number = "9",

}

TY - JOUR

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

AU - Gul, Funda

AU - Sohrabi, Mahmood

AU - Ushakov, Alexander

PY - 2017

Y1 - 2017

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

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

KW - Conjugacy problem

KW - Free solvable groups

KW - Magnus embedding

KW - Power problem

KW - Word problem

UR - https://www.scopus.com/pages/publications/85020435300

UR - https://www.scopus.com/pages/publications/85020435300#tab=citedBy

U2 - 10.1090/tran/6880

DO - 10.1090/tran/6880

M3 - Article

AN - SCOPUS:85020435300

SN - 0002-9947

VL - 369

SP - 6189

EP - 6206

JO - Transactions of the American Mathematical Society

JF - Transactions of the American Mathematical Society

IS - 9

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this