Abstract 1 Introduction 2 Preliminaries 3 Condition for epimorphism testing 4 Efficient epimorphism testing of 𝐂𝐨𝐩𝐫𝐢𝐦𝐞(𝐀𝐛,𝐂𝐲𝐜) 5 Efficient epimorphism testing of 𝐂𝐨𝐩𝐫𝐢𝐦𝐞(𝐄𝐥𝐞𝐦𝐀𝐛,𝐄𝐥𝐞𝐦𝐀𝐛) 6 Efficient epimorphism testing in groups with limited Abelian composition factors 7 Conclusion and open problems References Appendix A Deferred proofs

Algorithms for Finite Group Epimorphism Testing

Joshua A. Grochow ORCID Department of Computer Science, University of Colorado Boulder, CO, USA
Department of Mathematics, University of Colorado Boulder, CO, USA
   Pranjal Srivastava ORCID Department of Maths and Computing, Indian Institute of Information Technology Vadodara, Gandhinagar, India    Dhara Thakkar ORCID Graduate School of Mathematics, Nagoya University, Japan
Abstract

The Group Epimorphism Problem (GpEpi) asks, given two finite groups G1 and G2, whether there exists a surjective group homomorphism, or epimorphism, from G1 to G2. When the input groups are given by their multiplication (Cayley) tables, the problem admits a quasipolynomial-time algorithm in general, but little is known about its complexity for structured classes of finite groups. In this paper, we study the computational complexity of GpEpi for several well-studied classes of finite groups.

Our main results are polynomial-time epimorphism tests for several classes of groups for which polynomial-time isomorphism testing was previously known:

  • Groups with Abelian normal Hall subgroups with cyclic complement

  • Groups with (product of) elementary Abelian normal Hall subgroup with elementary Abelian complement.

  • Groups with some constraints on their Abelian chief factors.

Keywords and phrases:
Group epimorphism problem, group-theoretic algorithms, polynomial-time algorithms, normal Hall subgroups
Category:
Track A: Algorithms, Complexity and Games
Funding:
Joshua A. Grochow: This author was supported by NSF CAREER award CCF-2047756.
Dhara Thakkar: The author is supported by JSPS KAKENHI 24H00071 and 25K24674.
Copyright and License:
[Uncaptioned image] © Joshua A. Grochow, Pranjal Srivastava, and Dhara Thakkar; licensed under Creative Commons License CC-BY 4.0
2012 ACM Subject Classification:
Theory of computation Algorithm design techniques
; Theory of computation Algebraic complexity theory
Acknowledgements:
We thank the ICALP reviewers for helpful comments on the submission. DT would also like to thank Armin Weiss for bringing the Group Epimorphism problem to her attention.
Editors:
Sayan Bhattacharya, Danupon Nanongkai, Michael Benedikt, and Gabriele Puppis

1 Introduction

The study of computational problems in finite groups has a long history in both (computational) algebra and theoretical computer science. Among the most well-known is the Group Isomorphism problem (GpI), which asks whether two given groups are isomorphic. From the perspective of worst-case guarantees,111In this paper we focus on algorithms with worst-case guarantees as a function of the order of the group, though we occasionally comment on heuristics that will likely improve performance in practice. Because of our focus, we can without loss of generality assume that the multiplication (Cayley) tables are given as input. We refer the reader to the Handbook of Computational Group Theory [25], as well as, e. g., the works of Holt, Eick, O’Brien, Leedham-Green, and Hulpke [14, 7, 15, 6, 9, 26] for research into practical algorithms in more succinct input models. this problem has been extensively studied for various classes of groups, including Abelian groups, groups with normal Hall subgroups, and groups without Abelian normal subgroups [2, 1, 8, 4, 21, 23, 22, 30, 31, 34, 36, 40, 27]. Efficient algorithms in these settings often rely on exploiting the underlying algebraic structure, such as decompositions into simpler subgroups or the use of representation theory.

A related problem is the Group Epimorphism Problem (GpEpi), which, given two finite groups G1 and G2, asks to decide whether there exists an epimorphism (=surjective homomorphism)222In some concrete categories, such as the category of rings, the concepts of epimorphism and surjective homomorphism differ, but in the category of groups they are the same [32], so we do not dwell on the two definitions. from G1 to G2. When G1 and G2 are given by their Cayley tables, one can easily design an nlogpn+O(1)-time algorithm for the GpEpi problem, where |G1|=n and p is the smallest prime divisor of n. Unlike isomorphisms, epimorphisms allow the domain group to be larger and potentially more complex than the codomain, introducing new algorithmic and structural challenges.

The GpEpi problem has been studied previously, primarily in the setting of finitely presented groups, where the focus is often on decidability and hardness questions. In this context, Remeslennikov showed that the epimorphism problem is undecidable when both the source and target groups are non-Abelian nilpotent groups given by finite presentations [35]. Subsequent work has identified classes of target groups for which epimorphism testing is decidable or computationally hard. Friedl and Löh proved decidability results when the target group is virtually cyclic or a direct product of an Abelian and a finite group [17], while Elder, Shen, and Weiss showed that the problem is NP-complete for similar classes of targets [16]. Kuperberg and Samperton further established NP-hardness when the target is a fixed finite non-Abelian simple group [29].

In contrast, comparatively little is known about the computational complexity of GpEpi for finite groups given by their Cayley tables. While GpI and related problem have been extensively studied in this model, efficient algorithms for epimorphism testing remain largely unexplored. Understanding which classes of finite groups admit polynomial-time algorithms for GpEpi is a natural and significant open direction in computational group theory and complexity theory.

Motivated by this, in this paper, we investigate the computational complexity of GpEpi for several well-studied classes of groups. We focus on classes for which structural properties can be exploited algorithmically, and for which efficient isomorphism testing is known. In particular, we study GpEpi for groups with Abelian normal Hall subgroups and groups without Abelian composition factors. Our results build on and extend techniques from the literature on GpI, while also introducing a new representation-theoretic problem and developing algorithmic frameworks specific to epimorphism testing.

Before coming to our contributions we mention a few points on the general complexity of GpEpi, that also serve to motivate some of the classes of groups we consider. If |G|=|H|, then epimorphisms GH and isomorphisms are the same thing, so GpImpGpEpi. In particular, this means that for any class of groups we cannot put GpEpi for that class into 𝖯 without doing the same for GpI, hence we focus on classes of groups for which GpI is already known to be in 𝖯. It is clear that the problem is in 𝖭𝖯 (the epimorphism serves as a witness), and the generator-enumerator technique gives an |G|log|G|+O(1)-time algorithm for GpEpi. Unlike isomorphism problems, we do not know whether GpEpi is in 𝖼𝗈𝖠𝖬 (though the quasi-polynomial-time upper bound nonetheless implies that it is not 𝖭𝖯-complete unless the Exponential Time Hypothesis is false). Just as GpI reduces to Graph Isomorphism, GpEpi reduces to Graph Epimorphism, but the latter is 𝖭𝖯-complete, even for target graphs of size O(1) (epimorphisms to the triangle graph are the same as proper 3-colorings that use all three colors) [44, 18]. It is a somewhat interesting question whether GpEpi is in 𝖯 when the target group has size O(1).

1.1 Our Contributions

We study GpEpi for several well-studied classes of finite groups. For each such class, we design a deterministic polynomial-time algorithm for GpEpi. We now summarize our main results.

To put our results in context, we recall some of the significant progress on algorithms with worst-case guarantees for GpI, and use this opportunity to introduce some notation we will use throughout the paper. We begin with some notation: for two group classes X and Y, Coprime(X,Y) is the class of groups with a normal subgroup N from X and a complement H from Y, such that |N| and |H| are coprime. Let Ab be the class of Abelian groups and let Abp be the class of Abelian p-groups, where p is a prime. Let ElemAb be the class of elementary Abelian groups, and let Cyc be the class of cyclic groups.

Over the last two decades, two of the most general classes of groups for which polynomial-time algorithms for GpI have been developed fall into the following lines of work, and we make progress on solving GpEpi along these lines:

  • Coprime extensions. Le Gall [30] solves GpI for groups in Coprime(Ab,Cyc). Qiao, Sarma, and Tang [34] extended this to Coprime(Ab,ElemAb). This was extended to groups with Abelian Sylow towers by Babai & Qiao [4], and to tame Sylow towers in Grochow & Qiao [20]. We refer the reader to those papers for definitions as we do not yet handle GpEpi for such groups here.

    We do solve GpEpi for groups in Coprime(Ab,Cyc) (cf. Le Gall ibid.) and Coprime(ElemAb,ElemAb), and discuss challenges to extending our results to Coprime(Ab,ElemAb) (cf. Qiao–Sarma–Tang, ibid.).

  • Fitting-free groups. Isomorphism of groups without Abelian normal subgroups, a.k.a. semisimple or Fitting-free, was solved in [2] (building on [1]). This was extended to more general classes of groups in [21].

    Although we do not yet solve GpEpi for arbitrary Fitting-free groups, we handle two classes of groups that are more restrictive, yet headed in this direction. Namely, we solve GpEpi (1) for groups with no Abelian composition factors, and (2) for pairs (G,H) where H is Fitting-free and the Abelian chief factors of G have limited multiplicity. We discuss some challenges in extending this to all Fitting-free groups in Sec. 7.

For all the aforementioned results except the last, the classes of groups involved are closed under homomorphic images, and membership in the class is recognizable in polynomial time. If 𝒞 is any class of finite groups with these properties, then solving GpEpi for pairs (G,H) with G,H𝒞 is equivalent to solving GpEpi for pairs (G,H) where G𝒞 and H is arbitrary.

Efficient epimorphism testing of 𝐂𝐨𝐩𝐫𝐢𝐦𝐞(𝐀𝐛,𝐂𝐲𝐜).

We begin by considering the class Coprime(Ab,Cyc), consisting of groups that are extensions of an Abelian group by a cyclic group. This class serves as a first step beyond Abelian groups for GpEpi. Polynomial-time algorithms for GpI are known for this class due to Le Gall [30]. Theorem 1 shows that GpEpi can be solved efficiently for groups in Coprime(Ab,Cyc). Although we leverage some of the same algebraic structure used by Le Gall, we also use additional results from representation theory and combinatorial techniques (maximum matching in bipartite graphs).

Theorem 1.

There is a polynomial-time algorithm for GpEpi, restricted to pairs of groups (G1,G2) such that G1 is in Coprime(Ab,Cyc). If there is an epimorphism from G1 to G2, our algorithms computes one such.

Efficient epimorphism testing of 𝐂𝐨𝐩𝐫𝐢𝐦𝐞(𝐄𝐥𝐞𝐦𝐀𝐛,𝐄𝐥𝐞𝐦𝐀𝐛).

Next, we study GpEpi, for groups in the class Coprime(ElemAb,ElemAb), which consists of groups with a normal Hall subgroup that is a direct product of elementary Abelian groups, complemented by another elementary Abelian group. To develop an algorithm for this class, we first consider the subclass, Coprime(ElemAb,ElemAb).

To solve GpEpi for groups in Coprime(ElemAb,ElemAb), we reduce it to a problem in representation theory of finite groups. We now describe the specific formulation of this problem that captures the GpEpi.

A representation of a group G is a homomorphism from G to a general linear group. When the group G is a finite elementary Abelian normal subgroup of a larger group, the condition of epimorphism testing of large groups with respect to their component groups naturally translates into questions about representations (Theorem 7). This leads to an interesting algorithmic problem in representation theory that is of independent interest. We define this problem below after introducing the following definition.

Let V and W be two finite-dimensional vector spaces over a field 𝔽 of dimension d and d, respectively. Let τ:GGL(d,𝔽) and γ:GGL(d,𝔽) be two representations (see Section 2). We say that τ and γ are epivalent if there exists a surjective linear transformation ρ:VW such that ρτ(g)=γ(g)ρ for every gG.

Problem 1 (SInducedRepEpivalent).

Given two representations, τ:H1GL(m1,p)=Aut(pm1) and γ:H2GL(m2,p)=Aut(pm2), such that Hi are elementary Abelian q-groups, and p,q are distinct primes, determine whether there exists a surjective homomorphism ϕ:H1H2 such that the induced representation τ and γϕ are epivalent, i. e., there exists a surjective linear map ρ:pm1pm2 such that ρτ(h)=γ(ϕ(h))ρ, hH1.

The following theorem shows that SInducedRepEpivalent captures the essential difficulty of epimorphism testing for groups in Coprime(ElemAb,ElemAb).

Theorem 2.

For groups G1,G2Coprime(ElemAb,ElemAb), GpEpi is polynomial-time many-one equivalent to SInducedRepEpivalent.

To solve SInducedRepEpivalent in the above setting, we further reduce it to the well-known Code Isomorphism problem (Problem 2). This is similar to the technique used to solve GpI for this class of groups in polynomial time [34], but in our case reducing to Code Isomorphism requires additional work, since we start with an epimorphism problem and are reducing to an isomorphism problem (whereas in Qiao–Sarma–Tang [34] they were reducing from one isomorphism problem to another).

Theorem 3.

Using the notation of Problem 1, when Hi are elementary Abelian of rank d, and the representations have m=max{m1,m2}, the problem SInducedRepEpivalent reduces to CodeIso for d-dimensional codes in 𝔽m.

The above theorem enables us to derive the following result.

Corollary 4.

There is a polynomial-time algorithm for GpEpi, restricted to pairs of groups (G1,G2) such that G1Coprime(ElemAb,ElemAb).

We then extend this result to obtain an efficient algorithm for testing epimorphism between groups in Coprime(ElemAb,ElemAb).

Theorem 5.

There is a polynomial-time algorithm for GpEpi restricted to pairs of groups (G1,G2) such that G1Coprime(ElemAb,ElemAb).

Efficient epimorphism testing of groups with limited Abelian composition factors.

We next study the GpEpi, for groups with no Abelian composition factors, that is, finite groups whose composition factors are all non-Abelian simple groups. This class includes two important classes of groups, namely the direct product of non-Abelian simple groups, and almost simple groups. It forms a well-structured subclass of groups with no nontrivial Abelian normal subgroups (a.k.a. Fitting-free groups). Groups with no nontrivial Abelian normal subgroups have been widely studied in various algorithmic contexts, including efficient isomorphism testing (see e.g., [9, 1, 2]).

Groups with no Abelian composition factors has also been studied extensively in group theory, particularly in the context of structural classification, enumeration, and understanding their minimal faithful permutation degree (see, e.g., [28, 5, 38, 10, 33]). While algorithmic problems such as GpI and the Minimum Generating Set problem have been explored for various non-solvable group classes including Fitting-free groups, the computational complexity of GpEpi even for groups with no Abelian composition factors has not been addressed previously. Our main result for this class is the following.

Theorem 6.

There is a polynomial-time algorithm for GpEpi, restricted to pairs of groups (G1,G2) such that G1 has no Abelian composition factors.

We can extend this slightly in the direction of Fitting-free groups that allow Abelian composition factors of limited “multiplicity;” see Cor. 15 and the definitions preceding it.

Organization.

The remainder of the paper is organized as follows. We begin with preliminaries in Section 2. In Section 3, we develop a criterion for epimorphism testing for large groups, reducing the problem to normal Hall subgroups and their complements. In Section 4, we prove Theorem 1. In Section 5, we establish Theorem 2, Theorem 3, and Theorem 5. Finally, in Section 6, we prove Theorem 6. In Section 7, we conclude with several open problems.

2 Preliminaries

In this section, we recall some relevant terminology required for the paper. An interested reader may refer to standard references such as [37, 39] for more details.

Group theory.

We consider groups with finitely many elements. The order of group G is the number of elements in a group G, denoted by |G|. The order of an element gG, denoted as ord(g), is the smallest positive integer m such that gm=1. The exponent of G is the smallest positive integer m such that gm=1 for all gG. Let H be a subgroup of G, if for all aG, a1Ha=H then we say that H is a normal subgroup of G (denoted by HG). A normal Hall subgroup N is a normal subgroup of G with gcd(|N|,|G/N|)=1. For any subgroup H and any normal subgroup K of G we denote the subgroup {hk|hH,kK}={kh|hH,kK} by HK.

Let N be a normal subgroup of G. We say that G is semidirect product of N by a subgroup H of G, denoted as G=NH if G=NH and NH=1. Since NG, this gives rise to a homomorphism τ:HAut(N) by hχh, where χh:NN by nh1nh. In this case, we write G=NτH. We say N is a normal subgroup of this decomposition and H the complement of N in G. Conversely, given two groups N and H and a homomorphism τ:HAut(N), we can define a group G:={(n,h)nN,hH} with the product operation, (n1,h1)(n2,h2)=(n1χh1(n2),h1h2), for all (n1,h1),(n2,h2)G. This gives a construction of the outer semidirect product G=NτH. For a normal Hall subgroup N of G, the Schur–Zassenhaus theorem guarentees that a complement subgroup HG such that gcd(|H|,|N|)=1 and G=NτH exists. Furthermore, if H and K are complements of N, then H and K are conjugate (see, e.g., [37]).

Socle series and chief series.

A minimal normal subgroup of G is a normal subgroup NG with no nontrivial subgroups that are also normal in G; equivalently, if MG and MN, then M{1,N}. A standard exercise is that every minimal normal subgroup of a finite group is a direct power Tn of some finite simple group T. The socle of a group G, denoted Soc(G) is the (characteristic) subgroup generated by all minimal normal subgroups of G. The socle series of G is defined by Soc1(G):=Soc(G) and Soci(G) is the unique subgroup of G such that Soci(G)/Soci1(G)=Soc(G/Soci1(G)).

A normal series in G is a series 1=N0N1N2Nk=G such that NiG for all i. A chief series is a normal series that cannot be further refined (a so-called “maximal” normal series). Equivalently, a chief series is a normal series such that Ni/Ni1 is a minimal normal subgroup of G/Ni1 for all i. If N is a chief series, then the factor groups Ni/Ni1 are called chief factors of G. Each chief factor is of the form Tn for some simple group T and some integer n, and the multiset of isomorphism types of chief factors is well-defined for G, independent of the chief series (see e.g., [24, Theorem 8.4.4]).

The socle series can be refined to a chief series by taking the minimal normal subgroups M1,,Mk of G/Soci(G), taking their pre-images M^1,,M^k in G, and then inserting them in between Soci(G) and Soci+1(G) in any order, viz. Soci(G)Soci(G)M1Soci(G)M1M2Soci(G)M1M2Mk1Soci+1(G). We say G has socle length if is the least integer such that G=Soc(G).

The Code Isomorphism problem.

Let 𝔽 be a field. A d-dimensional linear subspace C𝔽n is called a linear code of dimension d. A generating matrix of a linear code C, of dimension d, is a d×n matrix with row vectors being a basis of C. We will also use C to denote the generating matrix of a linear code C.

Problem 2 (Code Isomorphism).

Given two generating matrices Cd×n and Dd×n over the field 𝔽, the Code Isomorphism Problem asks to determine the existence of TGL(d,𝔽) and a permutation matrix Pn×n such that Td×dCd×nPn×n=Dd×n.

Representation theory.

Let V be a vector space of dimension d over 𝔽. A representation of a group G is a homomorphism τ:GGL(d,𝔽). A subspace W of V is called G-invariant if for all gG and wW, we have τg(w)W. A representation τ:GGL(d,𝔽) is called irreducible if the only G-invariant subspaces of V are 0 and V.

Let V and W be two finite-dimensional vector spaces over a field 𝔽 of dimension d and d, respectively. We say that two representations τ:GGL(d,𝔽) and γ:GGL(d,𝔽) are equivalent if there is an invertible linear map f:VW such that fτg=γgf for all gG.

Let N be an elementary abelian p-group and let G=NτH be a group, where τ:HAut(N) is an action of H on N. Since N is an elementary abelian p-group, Npd, and Aut(N)=GL(d,𝔽p). Then the homomorphism τ can be seen as a representation of H given by τ:HAut(N)=GL(d,𝔽p).

Linear algebra and Modules.

We say that matrix Ad×n of rank d is in standard form if A=[Id|A], i.e., the first d columns of A form the identity matrix. We can perform row operations on A followed by a permutation of the columns to transform A to a standard form, i.e., we can find B and B such that BAB is in standard form.

Let R be a ring and M,N be R-modules. A map ϕ:MN is an R-module homomorphism if ϕ(αx+y)=αϕ(x)+ϕ(y) for all x,yM and αR. A module M is indecomposable if M=M1M2 implies M1=0 or M2=0.

Let G be a group. A (left) G-module is an abelian group A on which G acts by additive maps on the left, i.e., a left G-module consists of an abelian group A together with a left group action τ:G×AA such that g(a1+a2)=ga1+ga2, for all a1,a2A and gG. Similarly, we can define right G-module. Unless explicitly mentioned otherwise the term “G-module” will always mean “left G-module”. We refer reader to [45, 13] for more details on group modules.

3 Condition for epimorphism testing

In this section, prove that epimorphism testing for groups with normal Hall subgroups reduces to that for the normal Hall subgroups and their complements. Our proof is based on the ideas discovered by Taunt [41, Theorem 3.3]. A similar result for isomorphism testing between groups was established using the same ideas (see e.g., [34, Theorem 3]).

Theorem 7.

Given G1=N1τH1, G2=N2γH2, where N1,N2 are normal Hall subgroups. Then there is an epimorphism from G1 to G2 if and only if there exist an epimorphism ρ:N1N2, and an epimorphism ϕ:H1H2, such that, hH1,

ρτ(h)=γ(ϕ(h))ρ. (1)

Proof.

() Let f:G1G2 be an epimorphism from G1 to G2 such that G1/kerfG2. Let L=kerfN1 and K=kerfH1. It is easy to see that kerf=LτK.

We now show that the action of K on N1/L, given by (nL)k=knk1L for kK, nN1, is trivial. Since f(k)=1 we have f(knk1)=f(n), which implies that n1knk1kerf. Clearly n1knk1N1, therefore n1knk1L and knk1L=nL. Define an action τ of H1/K on N1/L given by τ(hK):=τ(h)L. Since K acts on N1/L trivially, τ is well-defined. Indeed, if hK=hK, then h=hk for some kK. τ(hK)(nL)=τ(h)(n)L=τ(hk)(n)L=(τ(h)τ(k))(n)L=τ(h)(τ(k)(n)L)=τ(h)(n)L=τ(hK)(nL).

Consider a map π:N1τH1LτKN1LτH1K defined by π(n1,h1)=(n1L,h1K). It is easy to see that π is an isomorphism. Moreover, N1LτH1KN2γH2, with |N1/L|=N2 and |H1/K|=H2. By [41, Theorem 3.3], there exist an isomorphism ρ¯:N1/LN2 and an isomorphism ϕ¯:H1/KH2 such that, hKH1/K, ρ¯τ(hK)=γ(ϕ¯(hK))ρ¯. By lifting ϕ¯,ρ¯,τ to ϕ,ρ and τ respectively, via the canonical epimorphism we obtain ρτ(h)=γ(ϕ(h))ρ.

() Consider a map f:G1G2 defined by f(n,h)=(ρ(n),ϕ(h)). It is clear that f is an epimorphism from G1 to G2. Now, consider

f((n,h)(n,h)) =f(nτh(n),hh)
=(ρ(nτh(n)),ϕ(hh))
=(ρ(n)ρ(τh(n),ϕ(h)ϕ(h))
=(ρ(n)γϕ(h)(ρ(n)),ϕ(h)ϕ(h))
=(ρ(n),ϕ(h))(ρ(n),ϕ(h))
=f(n,h)f(n,h).

Hence, f is an epimorphism from G1 to G2.

4 Efficient epimorphism testing of 𝐂𝐨𝐩𝐫𝐢𝐦𝐞(𝐀𝐛,𝐂𝐲𝐜)

In this section, we design an algorithm for finding an epimorphism between two groups G1 and G2 such that G1Coprime(Ab,Cyc). Before we present our algorithm, we prove certain preliminary results which will be required in the algorithm.

Consider two groups G1,G2Coprime(Ab,Cyc) defined as G1=N1τH1 and G2=N2γH2, where N1 and N2 are Abelian, and H1 and H2 are cyclic. Moreover, gcd(|H1|,|N1|)=1 and gcd(|H2|,|N2|)=1. Suppose there exists an epimorphism ρ:N1N2 that satisfies the condition of Equation 1 for some epimorphism ϕ:H1H2. Let K=ker(ϕ) be the unique subgroup of H1 whose order is |H1|/|H2|. Define a subgroup L of N1 generated by the set {vτ(k)vvN1, kK}. It is clear that Lker(ρ).

The following observation on L is of independent interest, and we realized it in the course of coming up with the proofs below. Although it is ultimately not required for our proofs, as it may be of future use we include its proof in Appendix A.

Observation 8.

With the notations above, L is a direct sum of maximal indecomposable H1-submodules of N1.

Let N be an Abelian group, but not necessary elementary Abelian. A (/pk)[H]-module is a H-module N where the exponent of N (the LCM of the orders of the elements of N) divides pk.

Lemma 9 ([42, Corollary 1.2]).

Let H be a finite group. If p is coprime to |H|, then any indecomposable (/pk)[H]-module is generated (as an H-module) by a single element.

Lemma 10.

Let N be an Abelian group (not necessarily elementary Abelian), and H a cyclic group acting on N by automorphisms. Moreover, suppose gcd(|N|,|H|)=1. Then a decomposition of N into its indecomposable H-submodules can be computed in polynomial time in |N|,|H|.

Proof.

For each vN, we compute the H-submodule vH of N. For each such submodule, we then use the algorithm of Ciocǎnea-Teodorescu [12, Theorem 1.1] to test whether vH appears as a direct summand in a direct sum decomposition of N as an H-module, and if so, to find a complement, that is, another H-submodule UN such that N=vHU. As soon as one such direct sum decomposition is found, the algorithm is then called recursively on vH and U to see if they can be further decomposed. Furthermore, if N is decomposable, then there must exist a vN such that vH is a direct summand, for N must contain an indecomposable direct summand by induction on its size, and for a prime p dividing |N|, by Lemma 9, in this setting, indecomposable H-modules are generated by a single element. If no such direct sum decomposition is found, then N is an indecomposable H-module, and the recursion stops.

In practice, some pre-processing can be done beforehand; for example, at the start, N can be split into a direct sum of its Sylow p-subgroups for different primes p. And within each Sylow p-subgroup, if vH=puH for some uN, then vH is not a direct summand of N and can be excluded from the above search.

We are now ready to prove Theorem 1.

Proof of Theorem 1.

First we check that G2 is in Coprime(Ab,Cyc) (otherwise reject). In order to test whether there is an epimorphism between G1 and G2, we first run the algorithm from [34, Theorem 1] on the inputs G1 and G2 to obtain all normal Hall subgroups and their complements. We then select an arbitrary normal Hall subgroup N1 of G1 (respectively, N2 of G2) and its complement H1 (respectively, H2) such that |N1||N2|, |H1||H2|, N1 and N2 are Abelian, and H1 and H2 are cyclic. All these conditions can be verified in polynomial time for each normal Hall subgroup and all of its complements. If no such pair of normal Hall subgroup and its complement exists, then by Theorem 7, we conclude that there is no epimorphism from G1 to G2. Otherwise, we proceed as follows.

Since every finite cyclic group has a unique subgroup of any given order dividing its order, there exists a unique subgroup KH1 such that |H1/K|=|H2|. If no such K exists, then the algorithm will reject. Moreover, K can be computed in polynomial time. Let τ (respectively, γ) be a conjugation action of H1 on N1 (respectively, H2 on N2). We compute the normal subgroup L={vτ(k)v|vN1,kK}N1, and determine its order in polynomial time.

If |N1/L|=|N2| then there is an epimorphism from G1 to G2 if and only if the groups N1/LτH1/K and N2γH2 are isomorphic333The quotient H1/K naturally inherits the action τ since K acts trivially on N1/L (see, e.g., proof of Theorem 7) (see the proof of Theorem 7). There exists a polynomial-time algorithm to test whether these two groups are isomorphic and, if so, to compute an explicit isomorphism between them by Le Gall [30, Theorem 1.2]. If such an isomorphism exists, we can lift it to an epimorphism from G1 to G2 by composing the canonical epimorphism, G1N1/LτH1/K, with the computed isomorphism from N1/LτH1/K to G2.

Otherwise, we may assume |N1/L|>|N2| (for if |N2|>|N1/L| then the algorithm can simply return that there is no epimorphism). Since LN1 and N1 is an H1-module, it follows that L and N1/L both are an H1-module. Let Vi and Uj denote the decomposition of N1/L and N2 into their indecomposable H1-submodules and H2-submodules, respectively. These decompositions can be computed in polynomial time by Lemma 10. Note that the underlying group of each Vi is (/piki)di, for some pi, and the exponent of Vi divides piki (see, e.g., [42, 19]). Moreover, the underlying group of the quotient Vi/piVi is an elementary Abelian group (/pi)di [42].

Let ϕ¯:H1/KH2 be an isomorphism. All such isomorphisms can be computed in polynomial time, as both H1/K and H2 are cyclic groups. Fix such an isomorphism ϕ¯. For each i, the module Vi inherits an H2-module structure via ϕ¯, since K acts trivially on Vi.

We now construct a bipartite graph Γϕ¯ as follows. The vertex set of Γϕ¯ is the disjoint union of two sets, one containing a vertex labeled i for each Vi, and the other containing a vertex labeled j for each Uj. There is an edge (i,j) between vertices i and j if and only if there exists lijki such that there is an H2-module isomorphism from Vi/pilijVi to Uj.

Claim 11.

For some lijki there is an H2-module isomorphism from Vi/pilijVi to Uj if and only if there is an H2-modules isomorphism from Vi/piVi to Uj/piUj, and exponent(Uj)exponent(Vi).

Proof of Claim 11.

Let ρij:Vi/pilijViUj be an H2-module isomorphism. Note that (/piki)di and (/piki)dj are the underlying groups of Vi and Uj, respectively. Additionally, we have (/pilij)di(/piki)di/pilij(/piki)di=Vi/pilijViUj=(/piki)dj implies that di=dj and ki=lij. Define fij:Vi/piViUj/piUj by fij(v+piVi)=ρij(vmodpilijVi)+piUj, where v=(v1,,vdi)Vi and Vi/piVi(/pi)di. It is easy to see that fij is an epimorphism. Moreover, fij(𝐯h+piVi)=ρij(𝐯hmodpilijVi)+piUj=ρij(vmodpilijVi)h+piUj=fij(𝐯+piVi)h, where hH2. Therefore, by Schur’s lemma [39, Proposition 4] we have fij is an H2-module isomorphism.

Next, we have for each vVi/pilijVi, there is vVi such that ord(v)=ord(v)mv for some positive integer mv. This implies exponent(Uj)=exponent(Vi/pilijVi)=lcm(ord(v)|vVi/pilijVi)=lcm(ord(v)/mv|vVi)lcm(ord(v)|vVi)=exponent(Vi).

Conversely, let fij:Vi/piViUj/piUj be an H2-module isomorphism and let exponent(Uj)exponent(Vi). Let (/piki)di and (/piki)dj be the underlying groups of Vi and Uj, respectively. Since fij is an isomorphism, we have di=dj. Take lij=kiki. By [42, Theorem 1.1], if modules Vi/pilijVi and Uj are not isomorphic then so the modules (Vi/pilijVi)/(piVi/pilijVi) and Uj/piUj. This completes the proof of the claim.

First, we see that the graph Γϕ¯ and the isomorphism ρij can be constructed in deterministic polynomial time. By Claim 11, to test whether there is an H2-module isomorphism from Vi/pilijVi to Uj it is enough to test whether there is an H2-modules isomorphism from Vi/piVi to Uj/piUj, and that exponent(Uj)exponent(Vi). Since the Cayley tables of the underlying groups of Vj and Uj can be constructed, we can compute exponent(Uj) and exponent(Vi) in polynomial time.

Both Vi/piVi and Uj/piUj are elementary Abelian pi-groups. Let MVi,MUjGL(𝔽pi,di) be the matrices induced by an action of H2 on Vi/piVi and Uj/piUj respectively. Testing whether there is an H2-modules isomorphism between these modules is equivalent to testing whether MVi and MUj are conjugate in GL(𝔽pi,di). Since GL(𝔽p,n) is an 𝔽p-algebra, this conjugacy problem can be solved in deterministic polynomial time as described in [11, Theorem 2]. Moreover, this algorithm also compute a matrix T such that T1MViT=MUj, if such a T exists. Then fij is the corresponding linear map. Moreover, we can compute a module isomorphism ρij by [12, Corollary 1.2]. Therefore, the graph Γϕ¯ and the isomorphism ρij can be constructed in deterministic polynomial time.

Next, we compute a maximum matching in Γϕ¯, which can be done in polynomial time. If the matching saturates all the vertices corresponding to the Uj’s, i.e., if its size equals the number of indecomposable H2-modules of N2, then the matching defines the epimorphism from N1/L to N2, say ρ¯ (otherwise, we conclude that no epimorphism from N1/L to N2 exists and hence there is also no epimorphism from G1 to G2). Moreover, since we have computed the homomorphism ρij corresponding to the matched edges, we can explicitly construct ρ¯ in polynomial time. Note that (ρ¯,ϕ¯) gives an isomorphism from N1/LτH1/K to G2 since ρ¯ and ϕ¯ satisfies Equation 1 by construction. Next, we lift this isomorphism to an epimorphism from G1 to G2 by composing the canonical epimorphism G1N1/LτH1/K with the computed isomorphism.

5 Efficient epimorphism testing of 𝐂𝐨𝐩𝐫𝐢𝐦𝐞(𝐄𝐥𝐞𝐦𝐀𝐛,𝐄𝐥𝐞𝐦𝐀𝐛)

In this section, we solve GpEpi for groups from Coprime(ElemAb,ElemAb). We first prove Theorem 2 in Section 5.1. Then we further study SInducedRepEpivalent in Section 5.2 where we prove Theorem 3. We conclude this section by proving Theorem 5.

5.1 Proof of Theorem 2

Proof of Theorem 2.

GpEpi of Groups in Coprime(ElemAb,ElemAb) to SInducedRepEpivalent. By listing all normal Hall subgroups and their complements, we can find a normal Hall subgroup N1 of G1 (resp. N2 of G2) with complement H1 (resp. H2), such that both N1 and N2 are elementary Abelian p-groups, both H1 and H2 are elementary Abelian q-groups. Thus, in order to test the epimorphism of the G1 and G2, we first solve the group epimorphism problem for the normal and complement parts. Since the normal and complement parts of G1 and G2 are both elementary abelian, their epimorphism problems can be solved in polynomial time by checking their orders. Given this, the only task left is to test whether there exist epimorphisms ρ:N1N2 and ϕ:H1H2 satisfying Equation 1, which can be reduces to solving SInducedRepEpivalent by considering the representations τ and γ as an instance of the problem SInducedRepEpivalent.

SInducedRepEpivalent to GpEpi of Groups from Coprime(ElemAb,ElemAb). As discussed in Section 2, a representation τ:HAut(N), defines a group G=NτH. Given two representations, τ:H1Aut(pm1) and γ:H2Aut(pm2), we can construct two groups G1=pm1τH1 and G2=pm2γH2. Since Hi’s are elementary Abelian q-groups, both G1,G2Coprime(ElemAb,ElemAb). Then we can call an oracle to test if there is an epimorphism from G1 to G2. By Theorem 7, the two representations are epivalent if and only if there is an epimorphism from G1 to G2, which gives the reduction.

5.2 Proof of Theorem 3

Representations of 𝒒𝒍 over 𝒑.

Before we proceed to prove Theorem 3, we recall some basic facts on representations of ql over p, where p and q are two different primes. The reader can refer to [34, Section A5] for details.

Let Φq(x) be the qth cyclotomic polynomial. Let h1(x)hr(x) are factors of Φq(x) over p such that hi’s are monic polynomial of same degree m=(q1)/r, where m is the order of p in the multiplicative group (/q)×. Let MGL(p,d) be the companion matrix of h1(x). For each nonzero vector vql, define v:qlq,v(u)=(v,u) (inner product of u and v), and define a representation fv:qlGL(p,d),fv(u)=Mv(u). Then fv is an irreducible representation of ql over p, and {fv|vql} is the set of all irreducible representations of ql over p.

Let τ:qlGL(p,m1) and γ:qlGL(p,m2) be two representations of ql and let m2m1. By Maschke’s theorem (see e.g., [39, Theorem 1], both τ and γ can be written as direct sum of irreducible representations as follows, τfv1k1fvtkt,viql and γ=fu1r1futrt,uiql.

Lemma 12.

With the notation above, τ and γ are epivalent if and only if for every irreducible representation fuj of γ with multiplicity rj, there is an irreducible representation fvi of τ equivalent to fuj with multiplicity at least rj .

Proof.

Assume that τ and γ are epivalent. Let T:pm1pm2 be a surjective linear map. Since both pm1 and pm2 are both ql-modules, T is also a surjective ql-module homomorphism. By fundamental theorem of module homomorphism, we have pm1/ker(T)pm2 which implies that pm1ker(T)pm2. Thus, each fuj appear in the decomposition of τ with multiplicity at least rj for 1jt. Conversely, if all irreducible constituents of γ appear in τ with the appropriate multiplicities, then we can define a surjective ql-module homomorphism T:pm1pm2 by projecting onto the relevant direct summand.

Let τ:ql1GL(p,m1) and γ:ql2GL(p,m2) be two representations. Let fu be an irreducible representation of ql2 over p, appears in the decomposition of γ. Let ϕ:ql1ql2 be a surjective linear transformation. Then the induced representation of fu by ϕ gives the representation fuϕ. Moreover, (fuϕ)(v)=fϕT(u)(v), for all vql1 [34, Section 5.1].

We decompose τ=fv1k1fvtkt, for viql1,i[t], and γ=fu1r1futrt, for uiql2,i[t] into their irreducible representations such that k1++kt=m1 and r1++rt=m2. This decomposition can be computed in polynomial time, as shown in [34, Proposition 2]. Consider a set 1={v1,,v1,,vt,,vt} of vectors in ql1, where each vi appears exactly ki times in the set 1. Similarly, let 2={u1,,u1,,ut,,ut} of vectors in ql2, where each uj appears exactly rj times in the set 2. Using 1 and 2, we construct two matrices, M1=(v1,,v1,,vt,,vt) of order l1×m1, and M2=(u1,,u1,,ut,,ut) of order l2×m2.

To test if there is an epimorphism from G1 to G2, where G1 and G2 identified as G1=pm1τql1 and G2=pm2γql2, by Theorem 2 we can view τ (resp. γ) as representations of ql1 (resp. of ql2) over p of dimension m1 (resp. m2). We solve SInducedRepEpivalent problem for τ and γ.

Proof of Theorem 3.

By Lemma 12, τ and γϕ are epivalent if and only if for each j[t], there exists i[t] such that fϕT(uj) is equivalent to fvi and rjki. This latter condition is equivalent to verifying that {ϕT(u1),,ϕT(urt)}{v1,,vt} as each irreducible representation of ql1 is of the form fvi for some viql1. To test whether {ϕT(u1),,ϕT(urt)}{v1,,vt}, it is enough to compute the linear transformation ϕ, a matrix Pm1×m2 such that each row and each column of P contains at most one entry equals to 1 (with all other entries being zero), and the equality M1P=ϕTM2 holds. We now prove that finding such ϕ and P can be reduced to an instance of Code Isomorphism.

Without loss of generality, we may assume that rank(M1)=l1 (resp. rank(M2)=l2). We can perform row operations on M1 (resp. on M2) followed by a permutation of the columns to transform M1 (resp. M2) to a standard form. Let A1GL(q,l1) (resp. A2GL(q,l2)) and B1 a permutation matrix in GL(q,m1) (similarly B2GL(q,m2)) be such that A1M1B1=[Il1|M1] (resp. A2M2B2=[Il2|M2]). Since P is an injection matrix, we can write P=SQ, where S=[Im2𝟎] is of dimension m1×m2 and Q is a permutation matrix of dimension m2×m2.

Note that the number of zero columns of M2 can be at most the number of zero columns of M1, as otherwise, there can not exist P and ϕT satisfying M1P=ϕTM2 (in which case the algorithm immediately rejects). Therefore, once we get to this point, we can safely delete all the zero columns of M1 and M2. Now

M1P =ϕTM2
A11[Il1M1]B11SQ =ϕTA21[Il2M2]B21
[Il1M1]B11SQB2 =A1ϕTA21[Il2M2] (2)

Note that rank([Il1M1]B11S)=rank(M1P)=rank(ϕTM2)=l2. Let ψ be the matrix such that ψ[Il1M1]B11S=[M1~𝟎], where M1~ is of dimension (l2×m2) and rank(M1~)=l2. Let Q~=QB2. We have ψ[Il1M1]B11SQB2=[M1~Q~𝟎]. By Equation 2, there exists ϕT~ such that ψA1ϕTA21[Il2M2]=[ϕT¯𝟎][Il2M2], where ϕT~(l2×l2) is of rank l2. It follows now from Equation 2 that

M1~Q~=ϕT¯[Il2M2] (3)

Equation 3 is an instance of the Code Isomorphism problem, completing the proof.

Corollary 4 then follows from Theorem 2 and Theorem 3. At that point, Babai’s algorithm for Code Isomorphism in singly exponential time [1] gives a polynomial-time algorithm for SInducedRepEpivalent for elementary Abelian groups, finishing the proof of Corollary 4.

Next, we prove Theorem 5.

Proof of Theorem 5.

The idea for Coprime(ElemAb,ElemAb) can be extended to Coprime(ElemAb,ElemAb) as follows. First we check that G2 is in Coprime(ElemAb,ElemAb) (otherwise reject). For both G1 and G2, we compute all the normal Hall subgroups and their complements in polynomial time by [34, Theorem 1]. Additionally, we can identify G1,G2 as G1=iS1pikiτql1 and G2=iS2pikiγql2 with the associated actions as τ and γ, respectively.

Now we need to test if there exist an epimorphism ψ:iS1pikiiS2piki and ϕ:ql1ql2 such that ψτ(h1)=γ(ϕ(h1))ψ,h1ql1. Let τi:ql1GL(pi,ki) be the projection of τ into the i-th component for iS1, and let γi:ql2GL(pi,ki) be the projection of γ into the i-th component for iS2. For each τi and γi, let Mi and Mi be the matrices arising from the irreducible representation τi and γi, respectively (see proof of Theorem 3). Define M1:=diag(Mi)iS1,M2=diag(Mi)iS2, i.e., M1 (resp. M2) is a block diagonal matrix with diagonal blocks Mi (resp. Mi). Then it suffices to solve M1P=ϕM2 as in Theorem 3.

6 Efficient epimorphism testing in groups with limited Abelian composition factors

In this section, we prove Theorem 6. We first prove the following lemma.

Lemma 13.

Suppose H is a quotient of G, and let be the socle length of G. Then there exist integers k1,,k and groups Mij for i=1,, and j=1,,ki for all i such that

  1. 1.

    Mij is a minimal normal subgroup of G/Soci1(G)

  2. 2.

    There is a minimal normal subgroup M^ij of Gi:=G/M^ij:i<i and j[ki] such that the natural quotient map GiG/Soci1(G) maps M^ij isomorphically onto Mij.

  3. 3.

    HG+1.

Proof.

Let KG be such that G/KH. Let M11,,M1,k1 be the minimal normal subgroups of G that are contained in K. Then we can define M^1j=M1j to satisfy the first two parts of the lemma. Define K1=M1j|j[k1].

Now let i>1, and suppose inductively that Mij, M^ij have been defined for all i<i and all j[ki] that satisfy (1) and (2) and such that Mi,1,,Mi,ki are all the minimal normal subgroups of G/Soci1(G) that are contained in K/Soci1(G). Define Ki1=Mij|i<i;j[ki], and let M^i1,,M^i,ki be the minimal normal subgroups of G/Ki1 that are contained in K/Ki1. First, we claim that they are mapped isomorphically onto their images by the natural quotient map G/Ki1G/Soci1(G); call these images Mij. For if some M^ij is not mapped isomorphically onto its image by this map, then it must be contained in the kernel of the map, hence in Soci1(G). But since M^ij was contained in K/Ki1, if it were also in Soci1(G), then by construction M^ij would have been contained in Ki1 (since the latter is equal to KiSoci1(G)), contradicting the fact that it was a minimal normal subgroup of G/Ki1. Let Mij be the image of M^ij in G/Soci1(G). Then Mij is indeed a minimal normal subgroup of G/Soci1(G).

The above induction continues until K/Ki=1, at which point K=Ki. Since each time we progress up the socle series, this happens at some i+1, and thus we satisfy part (3) of the lemma.

Proof of Theorem 6.

First, we check that G2 has no Abelian composition factors (otherwise reject). Computing the composition factors in poly(|G2|) time is easy (indeed, computing the composition factors of permutation groups can even be done in 𝖭𝖢 [3]).

Next, we compute a chief series of G1 that refines the socle series, which is again easy by standard techniques.

For all subsets of the chief factors in our computed chief series – note that the chief series has length at most log|G1|, hence that are at most 2log|G1||G1| many such subsets – we attempt to make those the kernel of an epimorphism G1G2. Say the subset we pick has Mij for j=1,,ki that are among the minimal normal subgroups of G1/Soci1(G1).

First, we check that the order is correct: if |G1|/i,j|Mij||G2|, then skip this choice of subset of the chief factors.

Next, we check that this subset of chief factors is a valid kernel, in the sense of Lemma 13. That is, we check inductively that there are subgroups M^ij corresponding to the chosen Mij that satisfy parts (1) and (2) of Lemma 13. If so, then we finally we compute the quotient G1/i,jM^ij, and test isomorphism between that group and G2. The latter can be done in polynomial time since G2 is Fitting-free [2].

We can make some progress towards extending Theorem 6 to Fitting-free groups, and in doing so, we highlight one of the remaining obstacles. The issue is that when Soc(G) contains Abelian minimal normal subgroups T1,,Tk such that the subgroup they generate is their direct product, and such that all Ti are pairwise isomorphic as G-modules, then T1T2TkT1××Tk contains pΘ(k2) many Abelian normal subgroups N (normal in G) that are isomorphic to T1k/2 as G-modules. (In the “extreme” case that the Ti are central, they are each 1-dimensional, trivial G-modules p, and the previous discussion is the same as saying that a k-dimensional vector space has a number of k/2-dimensional subspaces that is pΘ(k2).) Of course we have klogp|G|, but if k=Θ(log|G|), then pΘ(k2)=|G|O(log|G|), so there are too many choices to brute force over them all in polynomial time. And then this issue can arise at any layer of the socle series.

Towards this direction, we make the following definition. Given an Abelian minimal normal subgroup TG, we define its multiplicity in G as the largest k such that there exist T1××TkG where all Ti are minimal normal subgroups of G such that they are all isomorphic to T as G-modules.

Definition 14.

The Abelian width of a group G is the maximum k such that there is an i0 and an Abelian minimal normal subgroup TG/Soci(G) of multiplicity k.

We note that the Abelian width is always at most O(log|G|), and there are even Fitting-free groups that achieve this width, for example: G=S5k has socle A5k, with quotient 2k, so its Abelian width is k=log120|G|.

However, we also note that the Abelian width can be quite a bit smaller than the dimension of any chief factor, as in the following example. For sufficiently large p, prime cyclic group Cp has p distinct irreducible representations over 𝔽3p1 (an extension of 𝔽3 that has p-th roots of unity), that are 1-dimensional over 𝔽3p1 (hence dimension p1 over 𝔽3). If we let N be the direct sum of those irreps, then the group G=NCp has order 3p(p1)p, the socle is N which has dimension Θ(p2) over 𝔽3, each irrep has dimension p1=Θ(log|G|) over 𝔽3, but the Abelian width is only 1 since N is a direct sum of pairwise non-isomorphic, irreducible Cp-modules (hence, the same is true when viewed as G-modules).

The following is a corollary to the proof of Theorem 6 above.

Corollary 15.

There is a polynomial-time algorithm for GpEpi, restricted to pairs of groups (G1,G2) such that G2 is Fitting-free and G1 has Abelian width at most O(log|G1|).

Proof sketch.

The idea is essentially the same as above, except we handle Abelian subgroups in each socle layer a little differently than the chief factors as in the proof of Theorem 6. If Soc(G/Soci1(G)) contains an Abelian G/Soci1(G)-module T of multiplicity k, then instead of breaking Tk up into its chief factors (isomorphic copies of T), we brute force over all possible copies of Tj contained within Tk, for j=0,1,,k, of which there are at most kpΘ(k2)|G|O(1) by our assumption that the Abelian width is O(log|G1|). The rest of the algorithm and proof are then the same as that of Theorem 6.

7 Conclusion and open problems

Of course the main question we leave open is whether GpEpi is in 𝖯 (a positive answer would imply GpI is in 𝖯). Other basic questions about its complexity are:

Open Question 1.

Is GpEpi in 𝖼𝗈𝖠𝖬?

Open Question 2.

What is the complexity of the counting problem #GpEpi?

As stepping stones towards understanding the complexity of GpEpi in general, other classes of groups for which GpI is in 𝖯 form natural targets for putting GpEpi into 𝖯:

Open Question 3.

Is GpEpi in 𝖯 when the input groups are:

  1. 1.

    Fitting-free (cf. [2, 1])?

  2. 2.

    When the target group has size O(1)? Or is O(1)-generated?

  3. 3.

    Quotients of genus 1 (cf. [31])? Both are of genus 2 (cf. [8])?

  4. 4.

    Groups with Abelian Sylow towers (cf. [4]) or tame towers (cf. [20])?

  5. 5.

    Groups with central, elementary Abelian radicals such that G/Rad(G) is a direct product of non-Abelian simple groups (cf. [21, Thm. C])?

We comment on the Fitting-free question. If the target group H is Fitting-free, then there is an epimorphism GH iff there is an epimorphism G/Rad(G)H (since if any part of the radical is not in the kernel, then it would yield an Abelian normal subgroup in the image), so we immediately reduce to the case that both groups are Fitting-free. If G,H are Fitting-free, deciding whether H is a quotient of G by a subgroup of Soc(G) doesn’t seem particularly hard; the difficulty arises when the socle of H may come from chief factors that are at many different layers of the socle series of G.

References

  • [1] László Babai, Paolo Codenotti, Joshua A. Grochow, and Youming Qiao. Code equivalence and group isomorphism. In Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1395–1408. SIAM, Philadelphia, PA, 2011. doi:10.1137/1.9781611973082.107.
  • [2] László Babai, Paolo Codenotti, and Youming Qiao. Polynomial-time isomorphism test for groups with no abelian normal subgroups. In Automata, Languages, and Programming: 39th International Colloquium, ICALP 2012, Warwick, UK, pages 51–62, 2012.
  • [3] László Babai, Eugene Luks, and Ákos Seress. Permutation groups in NC. In Proceedings of the nineteenth annual ACM symposium on Theory of computing, pages 409–420, 1987.
  • [4] László Babai and Youming Qiao. Polynomial-time isomorphism test for groups with abelian Sylow towers. In 29th International Symposium on Theoretical Aspects of Computer Science, volume 14 of LIPIcs. Leibniz Int. Proc. Inform., pages 453–464. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2012. doi:10.4230/LIPIcs.STACS.2012.453.
  • [5] R. Bercov. On groups without Abelian composition factors. J. Algebra, 5:106–109, 1967. doi:10.1016/0021-8693(67)90029-4.
  • [6] Hans Ulrich Besche and Bettina Eick. Construction of finite groups. J. Symbolic Comput., 27(4):387–404, 1999. doi:10.1006/JSCO.1998.0258.
  • [7] Hans Ulrich Besche, Bettina Eick, and E. A. O’Brien. A millennium project: constructing small groups. Internat. J. Algebra Comput., 12(5):623–644, 2002. doi:10.1142/S0218196702001115.
  • [8] Peter A. Brooksbank, Joshua Maglione, and James B. Wilson. A fast isomorphism test for groups whose Lie algebra has genus 2. J. Algebra, 473:545–590, 2017. doi:10.1016/j.jalgebra.2016.12.007.
  • [9] John J. Cannon and Derek F. Holt. Automorphism group computation and isomorphism testing in finite groups. J. Symbolic Comput., 35(3):241–267, 2003. doi:10.1016/S0747-7171(02)00133-5.
  • [10] Robert Chamberlain. Subgroups with no abelian composition factors are not distinguished. Bull. Aust. Math. Soc., 101(3):446–452, 2020. doi:10.1017/s0004972719001011.
  • [11] Alexander Chistov, Gábor Ivanyos, and Marek Karpinski. Polynomial time algorithms for modules over finite dimensional algebras. In Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (Kihei, HI), pages 68–74. ACM, New York, 1997. doi:10.1145/258726.258751.
  • [12] Iuliana Ciocǎnea-Teodorescu. The module isomorphism problem for finite rings and related results. arXiv:1512.08365 [math.RA], 2015. Abstract appeared at ACM Communications in Computer Algebra, Vol. 49 Iss. 1.
  • [13] David S. Dummit and Richard M. Foote. Abstract algebra. John Wiley & Sons, Inc., Hoboken, NJ, third edition, 2004.
  • [14] Bettina Eick, Max Horn, and Alexander Hulpke. Constructing groups of ‘small’ order: recent results and open problems. In Algorithmic and experimental methods in algebra, geometry, and number theory, pages 199–211. Cham: Springer, 2017. doi:10.1007/978-3-319-70566-8_8.
  • [15] Bettina Eick, C. R. Leedham-Green, and E. A. O’Brien. Constructing automorphism groups of p-groups. Comm. Algebra, 30(5):2271–2295, 2002.
  • [16] Murray Elder, Jerry Shen, and Armin Weiss. On the complexity of epimorphism testing with virtually abelian targets. arXiv preprint, 2025. arXiv:2501.05283.
  • [17] Stefan Friedl and Clara Löh. Epimorphism testing with virtually Abelian targets. Confluentes Math., 13(1):61–78, 2021.
  • [18] Steven Gay, François Fages, Thierry Martinez, Sylvain Soliman, and Christine Solnon. On the subgraph epimorphism problem. Discrete Appl. Math., 162:214–228, 2014. doi:10.1016/J.DAM.2013.08.008.
  • [19] Joshua A. Grochow and Michael Levet. On the parallel complexity of group isomorphism via Weisfeiler–Leman. J. Comput. System Sci., 156, 2026. doi:10.1016/J.JCSS.2025.103703.
  • [20] Joshua A. Grochow and Youming Qiao. Polynomial-time isomorphism test of groups that are tame extensions. In 26th International Symposium on Algorithms and Computation (ISAAC) (Springer Lecture Notes in Computer Science 9472), pages 578–589, 2015. Full version available as arXiv:1507.01917 [cs.DS]. doi:10.1007/978-3-662-48971-0_49.
  • [21] Joshua A. Grochow and Youming Qiao. Algorithms for group isomorphism via group extensions and cohomology. SIAM J. Comput., 46(4):1153–1216, 2017. doi:10.1137/15M1009767.
  • [22] Joshua A. Grochow and Youming Qiao. On the complexity of isomorphism problems for tensors, groups, and polynomials I: Tensor isomorphism-completeness. SIAM J. Comput., 52(2):568–617, 2023. doi:10.1137/21M1441110.
  • [23] Joshua A. Grochow and Youming Qiao. On p-group isomorphism: search-to-decision, counting-to-decision, and nilpotency class reductions via tensors. ACM Trans. Comput. Theory, 16(1):Art. 2, 39, 2024.
  • [24] Marshall Hall. The theory of groups. Courier Dover Publications, 2018.
  • [25] Derek F. Holt, Bettina Eick, and Eamonn A. O’Brien. Handbook of computational group theory. Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall/CRC, Boca Raton, FL, 2005.
  • [26] Alexander Hulpke. The perfect groups of order up to two million. Math. Comput., 91(334):1007–1017, 2022. Also arXiv:2104.10828. doi:10.1090/mcom/3684.
  • [27] Gábor Ivanyos, Euan J. Mendoza, Youming Qiao, Xiaorui Sun, and Chuanqi Zhang. Faster isomorphism testing of p-groups of Frattini class 2. SIAM Journal on Computing, pages FOCS24–115, 2025.
  • [28] Benjamin Klopsch. Enumerating finite groups without abelian composition factors. Israel J. Math., 137:265–284, 2003. doi:10.1007/BF02785965.
  • [29] Greg Kuperberg and Eric Samperton. Computational complexity and 3-manifolds and zombies. Geom. Topol., 22(6):3623–3670, 2018. doi:10.2140/gt.2018.22.3623.
  • [30] François Le Gall. Efficient isomorphism testing for a class of group extensions. In STACS 2009: 26th International Symposium on Theoretical Aspects of Computer Science, volume 3 of LIPIcs. Leibniz Int. Proc. Inform., pages 625–636. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2009. doi:10.4230/LIPIcs.STACS.2009.1830.
  • [31] Mark L. Lewis and James B. Wilson. Isomorphism in expanding families of indistinguishable groups. Groups Complex. Cryptol., 4(1):73–110, 2012. doi:10.1515/gcc-2012-0008.
  • [32] C. E. Linderholm. A group epimorphism is surjective. Am. Math. Mon., 77:176–177, 1970. doi:10.2307/2317336.
  • [33] Giancarlo Lucchini Arteche. On homogeneous spaces with finite anti-solvable stabilizers. C. R. Math. Acad. Sci. Paris, 360:777–780, 2022. doi:10.5802/crmath.339.
  • [34] Youming Qiao, Jayalal Sarma, and Bang-Sheng Tang. On isomorphism testing of groups with normal Hall subgroups. Journal of Computer Science and Technology, 27(4):687–701, 2012. doi:10.1007/S11390-012-1255-7.
  • [35] V. N. Remeslennikov. An algorithmic problem for nilpotent groups and rings. Sibirsk. Mat. Zh., 20(5):1077–1081, 1167, 1979.
  • [36] David J Rosenbaum. Bidirectional collision detection and faster deterministic isomorphism testing. arXiv preprint, 2013. arXiv:1304.3935.
  • [37] Joseph J. Rotman. An introduction to the theory of groups, volume 148 of Graduate Texts in Mathematics. Springer-Verlag, New York, fourth edition, 1995. doi:10.1007/978-1-4612-4176-8.
  • [38] Luca Sabatini. The growth of abelian sections. Ann. Mat. Pura Appl. (4), 202(3):1197–1216, 2023. doi:10.1007/s10231-022-01276-w.
  • [39] Jean-Pierre Serre. Linear representations of finite groups, volume Vol. 42 of Graduate Texts in Mathematics. Springer-Verlag, New York-Heidelberg, french edition, 1977.
  • [40] Xiaorui Sun. Faster isomorphism for p-groups of class 2 and exponent p. In STOC’23 – Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pages 433–440. ACM, New York, 2023. doi:10.1145/3564246.3585250.
  • [41] D. R. Taunt. Remarks on the isomorphism problem in theories of construction of finite groups. Proc. Cambridge Philos. Soc., 51:16–24, 1955. doi:10.1017/s030500410002987x.
  • [42] Jacques Thévenaz. Representations of finite groups in characteristic pr. Journal of Algebra, 72(2):478–500, 1981.
  • [43] user2661923 (https://math.stackexchange.com/users/464411/user2661923). If 2a is the highest power of 2 which divides n!, show that a lies between n1 and nlog2(n+1). Mathematics Stack Exchange. URL: https://math.stackexchange.com/q/4349429 (version: 2022-01-05).
  • [44] Narayan Vikas. Computational complexity of graph compaction. ProQuest LLC, Ann Arbor, MI, 1997. Thesis (Ph.D.)–Simon Fraser University (Canada). URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:NQ24360.
  • [45] Charles A. Weibel. An introduction to homological algebra, volume 38 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1994.

Appendix A Deferred proofs

Below we give a proof of Observation 8. We recall the notation: N1 is an Abelian group that is coprime to the cyclic group H1, and τ:H1Aut(N1) is an action. KH1, and L={vτ(k)v:vN1,kK}. The observation to prove is that L is a direct sum of maximal indecomposable H1-submodules of N1.

Proof of Observation 8.

Let N1=iVi be a decomposition of N1 into its indecomposable H1-submodules, Vi. Let pi be the prime such that Vi is a pi-group. Define Vi:={vτ(k)v:vVi,kK}. Then we immediately have L=iVi. Then it is necessary and sufficient to show that Vi=Vi whenever Vi0.

From [42, Corollary 1.2] it follows that, since Vi is indecomposable and |H1| is coprime to |N1|, the only submodules of Vi are of the form pilVi for some l0.

Let pib be the exponent of Vi: pibVi=0 and pib1Vi0. Suppose that Vi=pilVi for some b>l1 (in particular, we are assuming Vi0, as that is the only case we need to handle). Then K acts trivially on Vimodpil. For kK, we have τ(k)=ι+pilMk, where ι is an identity map and MkEnd(Vi). We now prove that τ(k)pibl=ι. We have τ(k)pibl=(ι+pilMk)pibl=j=0pibl(piblj)(pilMk)j. To show that τ(k)pibl=ι, it is enough to show that pib divides (piblj)(pilMk)j for all j. If jpi then pib|(piblj). And if jb/l then pib|(pilMk)j. So now consider pij<b/l. The power of pi dividing j! is j/pi+j/pi2+j/pi3+jpi1. Thus, pibljpi1|(piblj).

Now suppose pi2 or l1. Then, we have l(pi1)jj1, and therefore

bljpi1+jl =b+l(j1)jpi1
b.

It follows that, pib|(piblj)(pilMk)j.

Finally, let us now consider the case when pi=2 and l=1. It is standard that if 2x|j!, then xj1 [43]. Therefore, 2b=2(b1)(j1)+j|(2b1j)(2Mk)j. Thus proves that τ(k)pibl=ι. This implies that ord(τ(k))|pibl. However, since τ:H1Aut(N1) is a homomorphism, ord(τ(k))|ord(k), and ord(k)||H1|. Since gcd(|N1|,|H1|)=1, we get ord(τ(k))=1, hence τ(k)=ι. This implies that Vi=0, which is a contradiction. Therefore, Vi=Vi. This completes the proof of Observation 8.