Abstract
We consider the problem of determining if two finite groups are isomorphic. The groups are assumed to be represented by their multiplication tables. We present an algorithm that determines if two Abelian groups with n elements each are isomorphic. The running time of this algorithm is O(n log p), where p is the smallest prime not dividing n. When n is odd, this algorithm runs in linear time; in general, it takes time at most O(n log log n), improving upon an algorithm with O(n log n) running time due to Vikas [13]. Our Abelian group isomorphism algorithm is a byproduct of an algorithm that computes the orders of all elements in any group (not necessarily Abelian) of size n in time O(n log p), where p is the smallest prime not dividing n. We also give an O(n) algorithm for determining if a group of size n, described by its multiplication table, is Abelian.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Apostol, T.M.: Introduction to Analytic Number Theory. Springer, Heidelberg (1997)
Garzon, M., Zalcstein, Y.: On isomorphism testing of a class of 2-nilpotent groups. Journal of Computer and System Sciences 42, 237–248 (1991)
Hall, M.: Theory of Groups. Macmillan Co., New York (1959)
Herstein, I.N.: Topics in Algebra. Blaisdell, New York (1964)
Ravi Kumar, S., Rubinfeld, R.: Property testing of Abelian group operations (manuscript)
Lipton, R.J., Snyder, L., Zalcstein, Y.: The Complexity of Word and Isomorphism Problems for Finite Groups. John Hopkins, Baltimore (1976)
MacLane, S., Birkhoff, G.: Algebra. Macmillan Co., New York (1964)
Mairson, H.G.: Some new upper bounds on the generation of prime numbers. Communications of the ACM 20, 664–669 (1977)
Miller, G.L.: On the nlogn isomorphism technique. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, May 1978, pp. 51–58 (1978)
Miller, G.L.: Graph isomorphism, general remarks. Journal of Computer and System Sciences 18, 128–142 (1979)
Pak, I.: Testing commutativity of a group and the power of randomization (preprint)
Savage, C.: An O(n2) Algorithm for Abelian Group Isomorphism. Technical Report TR 80-01, North Carolina State University (January 1980)
Vikas, N.: An O(n) Algorithm for Abelian p-Group Isomorphism and an O(n log n) Algorithm for Abelian Group Isomorphism. Journal of Computer and System Sciences 53, 1–9 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kavitha, T. (2003). Efficient Algorithms for Abelian Group Isomorphism and Related Problems. In: Pandya, P.K., Radhakrishnan, J. (eds) FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2003. Lecture Notes in Computer Science, vol 2914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24597-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-24597-1_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20680-4
Online ISBN: 978-3-540-24597-1
eBook Packages: Springer Book Archive