A polynomial time algorithm for the conjugacy problem in Zn o Z

Autors/ores

  • Bren Cavallo CUNY Graduate Center, New York
  • Delaram Kahrobaei CUNY Graduate Center New York

Paraules clau:

Conjugacy problem, semidirect product, MSC (2010), Primary 20F10, Secondary 20E06.

Resum

In this paper we introduce a polynomial time algorithm that solves both the conjugacy decision and search problems in free abelian-by-innite cyclic groups where the input is elements in normal form. We do this by adapting the work of Bogopolski, Martino, Maslakova, and Ventura in [1] and Bogopolski, Martino, and Ventura in [2], to free abelian-by-innite cyclic groups, and in certain cases apply a polynomial time algorithm for the orbit problem over Zn by Kannan and Lipton [7].

Keywords: Conjugacy problem, semidirect product. MSC (2010): Primary 20F10, Secondary 20E06.

Descàrregues

Les dades de descàrrega encara no estan disponibles.

Biografia de l'autor/a

Bren Cavallo, CUNY Graduate Center, New York




Descàrregues

Com citar

Cavallo, B., & Kahrobaei, D. (2014). A polynomial time algorithm for the conjugacy problem in Zn o Z. Reports@SCM, 1(1), 55–60. Retrieved from https://revistes.iec.cat/index.php/reports/article/view/124908

Número

Secció

Articles