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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
