On p-group isomorphism: search-to-decision, counting-to-decision, and nilpotency class reductions via tensors

Abstract

In this paper we study some classical complexity-theoretic questions regarding GROUP ISOMORPHISM (GPI). We focus on p-groups (groups of prime power order) with odd p, which are believed to be a bottleneck case for GPI, and work in the model of matrix groups over finite fields. Our main results are as follows. • Although search-to-decision and counting-to-decision reductions have been known for over four decades for GRAPH ISOMORPHISM (GI), they had remained open for GPI, explicitly asked by Arvind & Torán (Bull. EATCS, 2005). Extending methods from TENSOR ISOMORPHISM (Grochow & Qiao, ITCS 2021), we show moderately exponential-time such reductions within p-groups of class 2 and exponent p. • Despite the widely held belief that p-groups of class 2 and exponent p are the hardest cases of GPI, there was no reduction to these groups from any larger class of groups. Again using methods from TENSOR ISOMORPHISM (ibid.), we show the first such reduction, namely from isomorphism testing of p-groups of small class and exponent p to those of class two and exponent p. For the first results, our main innovation is to develop linear-algebraic analogues of classical graph coloring gadgets, a key technique in studying the structural complexity of GI. Unlike the graph coloring gadgets, which support restricting to various subgroups of the symmetric group, the problems we study require restricting to various subgroups of the general linear group, which entails significantly different and more complicated gadgets. The analysis of one of our gadgets relies on a classical result from group theory regarding random generation of classical groups (Kantor & Lubotzky, Geom. Dedicata, 1990). For the nilpotency class reduction, we combine a runtime analysis of the Lazard Correspondence with TENSOR ISOMORPHISM-completeness results (Grochow & Qiao, ibid.).