Count-free Weisfeiler–Leman and group isomorphism

Abstract

We investigate the power of counting in Group Isomorphism. We first leverage the count-free variant of the Weisfeiler–Leman Version I algorithm for groups [J. Brachter and P. Schweitzer, On the Weisfeiler–Leman dimension of finite groups, in 35th Annual ACM/IEEE Symp. Logic in Computer Science, eds. H. Hermanns, L. Zhang, N. Kobayashi and D. Miller, Saarbrucken, Germany, July 8–11, 2020 (ACM, 2020), pp. 287–300, doi:10.1145/3373718.3394786] in tandem with bounded non-determinism and limited counting to improve the parallel complexity of isomorphism testing for several families of groups. These families include:

• Direct products of non-Abelian simple groups.

• Coprime extensions, where the normal Hall subgroup is Abelian and the complement is an $O(1)$-generated solvable group with solvability class poly log log $n$. This notably includes instances where the complement is an $O(1)$-generated nilpotent group. This problem was previously known to be in $\mathsf{P}$ [Y. Qiao, J. M. N. Sarma and B. Tang, On isomorphism testing of groups with normal Hall subgroups, in Proc. 28th Symp. Theoretical Aspects of Computer Science, Dagstuhl Castle, Leibniz Center for Informatics, 2011), pp. 567–578, doi:10.4230/LIPIcs. STACS.2011.567], and the complexity was recently improved to $\mathsf{L}$ [J. A. Grochow and M. Levet, On the parallel complexity of group isomorphism via Weisfeiler–Leman, in 24th Int. Symp. Fundamentals of Computation Theory, eds. H. Fernau and K. Jansen, Lecture Notes in Computer Science, Vol. 14292, September 18–21, 2023, Trier, Germany (Springer, 2023), pp. 234–247].

• Graphical groups of class $2$ and exponent $p>2$ [A. H. Mekler, Stability of nilpotent groups of class 2 and prime exponent, J. Symb. Logic46(4) (1981) 781–788] arising from the CFI and twisted CFI graphs [J. -Y. Cai, M. Fürer and N. Immerman, An optimal lower bound on the number of variables for graph identification, Combinatorica12(4) (1992) 389–410], respectively. In particular, our work improves upon previous results of Brachter and Schweitzer [On the Weisfeiler–Leman dimension of finite groups, in 35th Annual ACM/IEEE Symp. Logic in Computer Science, eds. H. Hermanns, L. Zhang, N. Kobayashi and D. Miller, Saarbrucken, Germany, July 8–11, 2020 (ACM, 2020), pp. 287–300, doi:10.1145/3373718.3394786].

Notably, each of these families was previously known to be identified by the counting variant of the more powerful Weisfeiler–Leman Version II algorithm. We finally show that the $q$-ary count-free pebble game is unable to even distinguish Abelian groups. This extends the result of Grochow and Levet (ibid), who established the result in the case of $q=1$. The general theme is that some counting appears necessary to place Group Isomorphism into $\mathsf{P}$.