On the conjugacy problem in certain metabelian groups

Gryak, J. ; Kahrobaei, D. ; Martinez-Perez, C. (Universidad de Zaragoza)

Resumen: We analyze the computational complexity of an algorithm to solve the conjugacy search problem in a certain family of metabelian groups. We prove that in general the time complexity of the conjugacy search problem for these groups is at most exponential. For a subfamily of groups, we prove that the conjugacy search problem is polynomial. We also show that for a different subfamily the conjugacy search problem reduces to the discrete logarithm problem.

Idioma: Inglés

DOI: 10.1017/S0017089518000198

Año: 2019

Publicado en: GLASGOW MATHEMATICAL JOURNAL 61, 2 (2019), 251-269
ISSN: 0017-0895

Factor impacto JCR: 0.548 (2019)

Categ. JCR: MATHEMATICS rank: 245 / 324 = 0.756 (2019) - Q4 - T3

Factor impacto SCIMAGO: 0.427 - Mathematics (miscellaneous) (Q2)

Financiación: info:eu-repo/grantAgreement/ES/MINECO-FEDER/MTM2015-67781

Tipo y forma: Artículo (PrePrint)

Área (Departamento): Área Algebra (Dpto. Matemáticas)