Isomorphism testing of groups of cube-free order (Q2282990)

Let \(G\) and \(H\) be finite groups with cube-free orders, and assume that \(G\) and \(H\) are given as (quotients of) permutation groups. The authors describe an algorithm to decide whether \(G\) and \(H\) are isomorphic, and, if so, to construct an isomorphism \(G\to H\). This is based on the analysis of such groups by \textit{H. Dietrich} and \textit{B. Eick} [J. Algebra 292, No. 1, 122--137 (2005; Zbl 1112.20002); ibid. 367, 247--248 (2012; Zbl 1267.20001)] and \textit{S. Qiao} and \textit{C. H. Li} [J. Algebra 334, No. 1, 101--108 (2011; Zbl 1234.20027)]. The running time of the algorithm is polynomial in the input size.