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

共 18 条

[1]

Artin E., 1925, ABH MATH SEM HAMBURG, V4, P47

[2] CONJUGACY IN NILPOTENT GROUPS [J].