Faster Isomorphism Testing of p-Groups of Frattini Class 2

The finite group isomorphism problem asks to decide whether two finite groups of order$N$are isomorphic. Improving the classical$N^{O(\mathrm{I}\mathrm{o}\mathrm{g}N)}$-time algorithm for group isomorphism is a long-standing open problem. It is generally regarded that$p$groups of class 2 and exponent$p$form a bottleneck case for group isomorphism in general. The recent breakthrough by Sun (STOC '23) presents an$N^{O\left((\log N)^{5 / 6}\right)}$-time algorithm for this group class. In this paper, we improve Sun's algorithm by presenting an$N^{{\tilde{O}}\left((\log {N})^{1^{1 / 2}}\right)}$-time algorithm for this group class. We also extend our result to the more general$p$-groups of Frattini class 2. Our algorithm is obtained by sharpening the key technical ingredients in Sun's algorithm and building connections with other research topics. One intriguing connection is with the maximal and non-commutative ranks of matrix spaces, which have recently received considerable attention in algebraic complexity and computational invariant theory. Results from the theory of Tensor Isomorphism complexity class (Grochow-Qiao, SIAM J. Comput. '23) are utilized to simplify the algorithm and achieve the extension to$p$-groups of Frattini class 2.