Skip to main content Accessibility help



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.

Hide All
1. Auslander, L., On a problem of {P}hilip {H}all, Ann. Math. 86 (1) (1967), 112116.
2. Babai, L., Beals, R., Cai, J.-Y., Ivanyos, G. and Luks, E. M., Multiplicative equations over commuting matrices, in Proc. 3rd ACM-SIAM Symposium on Discrete Algorithms (SODA), 1996.
3. Baumslag, G. and Bieri, R., Constructable solvable groups, Math. Z. 151 (3) (1976), 249257.
4. Cavallo, B. and Kahrobaei, D., A polynomial time algorithm for the conjugacy problem in $\mathbb{Z}^n \rtimes \mathbb{Z}$, Reports@SCM 1 (1), 2014.
5. Eick, B. and Ostheimer, G., On the orbit-stabilizer problem for integral matrix actions of polycyclic groups, Math. Comput. 72 (243) (2003), 15111529.
6. Holt, D. F., Eick, B. and O'Brien, E. A., Handbook of computational group theory (Chapman & Hall/CRC, Boca Raton, 2005).
7. Horn, R. A. and Johnson, C. R., Matrix analysis (Cambridge University Press, New York, 1985).
8. Kannan, R. and Bachem, A., Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix, SIAM J. Comput. 8 (4) (1979), 499507.
9. Lennox, J. C. and Robinson, D. J. S., The theory of infinite soluble groups. Oxford mathematical monographs (The Clarendon Press, Oxford University Press, Oxford, 2004).
10. Noskov, G. A., Conjugacy problem in metabelian groups, Math. Notes Acad. Sci. USSR 31 (4) (1982), 252258.
11. Sims, C. C., Computation with finitely presented groups, vol. 48 (Cambridge University Press, New York, 1994).
12. Yap, C. K., Linear systems, in Fundamental Problems of Algorithmic Algebra, Chapter 10, (Oxford University Press, New York, 2000), 258299.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Glasgow Mathematical Journal
  • ISSN: 0017-0895
  • EISSN: 1469-509X
  • URL: /core/journals/glasgow-mathematical-journal
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed