Polynomial time conjugacy in wreath products and free solvable groups

被引：10

作者：

Vassileva, Svetla ^{[1
]}

机构：

[1] McGill Univ, Dept Math & Stat, Burnside Hall,Room 1005,805 Sherbrooke St West, Montreal, PQ H3A 2K6, Canada

来源：

GROUPS COMPLEXITY CRYPTOLOGY | 2011年 / 3卷 / 01期

关键词：

Solvable groups; wreath products; conjugacy problem; complexity;

D O I：

10.1515/GCC.2011.005

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We prove that the complexity of the conjugacy problems for wreath products and for free solvable groups is decidable in polynomial time. For the wreath product AwrB, we must assume the decidability in polynomial time of the conjugacy problems for A and B and of the power problem in B. Using this result and properties of the Magnus embedding, we show that the conjugacy and conjugacy search problems in free solvable groups are computable in polynomial time.

引用

页码：105 / 120

页数：16

共 50 条

[1] The geometry of the conjugacy problem in wreath products and free solvable groups
Sale, Andrew W.
[J]. JOURNAL OF GROUP THEORY, 2015, 18 (04) : 587 - 621
[2] The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC0
Alexei Miasnikov
Svetla Vassileva
Armin Weiß
[J]. Theory of Computing Systems, 2019, 63 : 809 - 832
[3] The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC0
Miasnikov, Alexei
Vassileva, Svetla
Weiss, Armin
[J]. THEORY OF COMPUTING SYSTEMS, 2019, 63 (04) : 809 - 832
[4] The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC0
Miasnikov, Alexei
Vassileva, Svetla
Weiss, Armin
[J]. COMPUTER SCIENCE - THEORY AND APPLICATIONS (CSR 2017), 2017, 10304 : 217 - 231
[5] CONJUGACY PROBLEM IN WREATH PRODUCTS AND FREE METABELIAN GROUPS
MATTHEWS, J
[J]. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1966, 121 (02) : 329 - &
[6] QUANTIFYING CONJUGACY SEPARABILITY IN WREATH PRODUCTS OF GROUPS
Ferov, Michal
Pengitore, Mark
[J]. QUARTERLY JOURNAL OF MATHEMATICS, 2022, 73 (04): : 1555 - 1593
[7] WREATH PRODUCTS AND EXISTENTIALLY COMPLETE SOLVABLE GROUPS
SARACINO, D
[J]. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1974, 197 : 327 - 339
[8] The conjugacy problem is solvable in free-by-cyclic groups
Bogopolski, O.
Martino, A.
Maslakova, O.
Ventura, E.
[J]. BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 2006, 38 : 787 - 794
[9] On polynomial products in nilpotent and solvable Lie groups
Dekimpe, K
[J]. PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2003, 131 (03) : 973 - 978
[10] Twisted conjugacy classes in wreath products
Goncalves, Daciberg
Wong, Peter
[J]. INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2006, 16 (05) : 875 - 886

← 1 2 3 4 5 →