Faster Isomorphism Testing of $p$-Groups of Frattini Class 2
The finite group isomorphism problem asks to decide whether two finite groups of order <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$N$</tex> are isomorphic. Improving the classical <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$N^{O(\mathrm{I}\mathrm{o}\mathrm{g}N)}$</tex> -time algorithm for group isomorphism is a long-standing open problem. It is generally regarded that <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$p$</tex> groups of class 2 and exponent <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$p$</tex> form a bottleneck case for group isomorphism in general. The recent breakthrough by Sun (STOC '23) presents an <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$N^{O\left((\log N)^{5 / 6}\right)}$</tex> -time algorithm for this group class. In this paper, we improve Sun's algorithm by presenting an <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$N^{{\tilde{O}}\left((\log {N})^{1^{1 / 2}}\right)}$</tex> -time algorithm for this group class. We also extend our result to the more general <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$p$</tex> -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 <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$p$</tex> -groups of Frattini class 2.
Authors
- Gábor Ivanyos (ORCID: https://orcid.org/0000-0003-3826-1735)
- Youming Qiao (ORCID: https://orcid.org/0000-0003-4334-1449)
- Xiaorui Sun
- Chuanqi Zhang (ORCID: https://orcid.org/0009-0004-4857-3454)
- Euan J. Mendoza
Institutions
- University of Technology Sydney (AU)
- University of Illinois Chicago (US)
- Hungarian Research Network (HU)
Publication Details
- Published
- 2024-10-27
- DOI
- https://doi.org/10.1109/focs61266.2024.00090
- Citations
- 2
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.69
Funders
- National Science Foundation
- Australian Research Council