A Polynomial Time Algorithm For The Conjugacy Decision and Search Problems in Free Abelian-by-Infinite Cyclic Groups
Group Theory
2014-10-21 v1 Computational Complexity
Abstract
In this paper we introduce a polynomial time algorithm that solves both the conjugacy decision and search problems in free abelian-by-infinite cyclic groups where the input is elements in normal form. We do this by adapting the work of Bogopolski, Martino, Maslakova, and Ventura in \cite{bogopolski2006conjugacy} and Bogopolski, Martino, and Ventura in \cite{bogopolski2010orbit}, to free abelian-by-infinite cyclic groups, and in certain cases apply a polynomial time algorithm for the orbit problem over by Kannan and Lipton.
Keywords
Cite
@article{arxiv.1410.5297,
title = {A Polynomial Time Algorithm For The Conjugacy Decision and Search Problems in Free Abelian-by-Infinite Cyclic Groups},
author = {Bren Cavallo and Delaram Kahrobaei},
journal= {arXiv preprint arXiv:1410.5297},
year = {2014}
}