Nearly linear time isomorphism algorithms for some nonabelian group classes (Q5918355)

A nonabelian group is Hamiltonian if all of its subgroups are normal. In this paper an \(O(n)\) algorithm is designed for the recognition and the isomorphism problem of Hamiltonian groups, where \(n\) is the order of the input groups. Furthermore, it is proved that there exists an \(\tilde{O}(n)\) algorithm for the recognition and the isomorphism problem of groups that can be decomposed as a direct product of a nonabelian group of bounded order and an abelian group, where \(n\) is the order of the input groups. Moreover, it is observed that testing normality, computing the center of a group, finding a logarithmic sized generating set, computing quotient groups for groups given by their Cayley table could be done in linear or nearly linear time.