Algorithms for Finite Group Epimorphism Testing
Abstract
The Group Epimorphism Problem asks, given two finite groups and , whether there exists a surjective group homomorphism, or epimorphism, from to . 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 subgroupsCategory:
Track A: Algorithms, Complexity and GamesFunding:
Joshua A. Grochow: This author was supported by NSF CAREER award CCF-2047756.Copyright and License:
2012 ACM Subject Classification:
Theory of computation Algorithm design techniques ; Theory of computation Algebraic complexity theoryAcknowledgements:
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 PuppisSeries and Publisher:
Leibniz International Proceedings in Informatics, Schloss Dagstuhl – Leibniz-Zentrum für Informatik
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 and , 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 to . When and are given by their Cayley tables, one can easily design an -time algorithm for the GpEpi problem, where and is the smallest prime divisor of . 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 -complete for similar classes of targets [16]. Kuperberg and Samperton further established -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 , then epimorphisms and isomorphisms are the same thing, so . 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 -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 (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 .
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 and , is the class of groups with a normal subgroup from and a complement from , such that and are coprime. Let be the class of Abelian groups and let be the class of Abelian -groups, where is a prime. Let be the class of elementary Abelian groups, and let 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 . Qiao, Sarma, and Tang [34] extended this to . 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 (cf. Le Gall ibid.) and , and discuss challenges to extending our results to (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 where is Fitting-free and the Abelian chief factors of 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 with is equivalent to solving GpEpi for pairs where and is arbitrary.
Efficient epimorphism testing of .
We begin by considering the class , 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 . 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 such that is in . If there is an epimorphism from to , our algorithms computes one such.
Efficient epimorphism testing of .
Next, we study GpEpi, for groups in the class , 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, .
To solve GpEpi for groups in , 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 is a homomorphism from to a general linear group. When the group 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 and be two finite-dimensional vector spaces over a field of dimension and , respectively. Let and be two representations (see Section 2). We say that and are epivalent if there exists a surjective linear transformation such that for every .
Problem 1 (SInducedRepEpivalent).
Given two representations, and , such that are elementary Abelian -groups, and are distinct primes, determine whether there exists a surjective homomorphism such that the induced representation and are epivalent, i. e., there exists a surjective linear map such that , .
The following theorem shows that SInducedRepEpivalent captures the essential difficulty of epimorphism testing for groups in .
Theorem 2.
For groups , 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 are elementary Abelian of rank , and the representations have , the problem SInducedRepEpivalent reduces to CodeIso for -dimensional codes in .
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 such that .
We then extend this result to obtain an efficient algorithm for testing epimorphism between groups in .
Theorem 5.
There is a polynomial-time algorithm for GpEpi restricted to pairs of groups such that .
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 such that 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 is the number of elements in a group , denoted by . The order of an element , denoted as , is the smallest positive integer such that . The exponent of is the smallest positive integer such that for all . Let be a subgroup of , if for all , then we say that is a normal subgroup of (denoted by ). A normal Hall subgroup is a normal subgroup of with . For any subgroup and any normal subgroup of we denote the subgroup by .
Let be a normal subgroup of . We say that is semidirect product of by a subgroup of , denoted as if and . Since , this gives rise to a homomorphism by , where by . In this case, we write . We say is a normal subgroup of this decomposition and the complement of in . Conversely, given two groups and and a homomorphism , we can define a group with the product operation, , for all . This gives a construction of the outer semidirect product . For a normal Hall subgroup of , the Schur–Zassenhaus theorem guarentees that a complement subgroup such that and exists. Furthermore, if and are complements of , then and are conjugate (see, e.g., [37]).
Socle series and chief series.
A minimal normal subgroup of is a normal subgroup with no nontrivial subgroups that are also normal in ; equivalently, if and , then . A standard exercise is that every minimal normal subgroup of a finite group is a direct power of some finite simple group . The socle of a group , denoted is the (characteristic) subgroup generated by all minimal normal subgroups of . The socle series of is defined by and is the unique subgroup of such that .
A normal series in is a series such that for all . 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 is a minimal normal subgroup of for all . If is a chief series, then the factor groups are called chief factors of . Each chief factor is of the form for some simple group and some integer , and the multiset of isomorphism types of chief factors is well-defined for , 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 of , taking their pre-images in , and then inserting them in between and in any order, viz. . We say has socle length if is the least integer such that .
The Code Isomorphism problem.
Let be a field. A -dimensional linear subspace is called a linear code of dimension . A generating matrix of a linear code , of dimension , is a matrix with row vectors being a basis of . We will also use to denote the generating matrix of a linear code .
Problem 2 (Code Isomorphism).
Given two generating matrices and over the field , the Code Isomorphism Problem asks to determine the existence of and a permutation matrix such that .
Representation theory.
Let be a vector space of dimension over . A representation of a group is a homomorphism . A subspace of is called -invariant if for all and , we have . A representation is called irreducible if the only -invariant subspaces of are and .
Let and be two finite-dimensional vector spaces over a field of dimension and , respectively. We say that two representations and are equivalent if there is an invertible linear map such that for all .
Let be an elementary abelian -group and let be a group, where is an action of on . Since is an elementary abelian -group, , and . Then the homomorphism can be seen as a representation of given by .
Linear algebra and Modules.
We say that matrix of rank is in standard form if , i.e., the first columns of form the identity matrix. We can perform row operations on followed by a permutation of the columns to transform to a standard form, i.e., we can find and such that is in standard form.
Let be a ring and be -modules. A map is an -module homomorphism if for all and . A module is indecomposable if implies or .
Let be a group. A (left) -module is an abelian group on which acts by additive maps on the left, i.e., a left -module consists of an abelian group together with a left group action such that , for all and . Similarly, we can define right -module. Unless explicitly mentioned otherwise the term “-module” will always mean “left -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 , , where are normal Hall subgroups. Then there is an epimorphism from to if and only if there exist an epimorphism and an epimorphism , such that, ,
| (1) |
Proof.
Let be an epimorphism from to such that . Let and . It is easy to see that .
We now show that the action of on , given by for , , is trivial. Since we have , which implies that . Clearly , therefore and . Define an action of on given by . Since acts on trivially, is well-defined. Indeed, if , then for some . .
Consider a map defined by . It is easy to see that is an isomorphism. Moreover, , with and . By [41, Theorem 3.3], there exist an isomorphism and an isomorphism such that, , . By lifting to and respectively, via the canonical epimorphism we obtain .
Consider a map defined by . It is clear that is an epimorphism from to . Now, consider
Hence, is an epimorphism from to .
4 Efficient epimorphism testing of
In this section, we design an algorithm for finding an epimorphism between two groups and such that . Before we present our algorithm, we prove certain preliminary results which will be required in the algorithm.
Consider two groups defined as and , where and are Abelian, and and are cyclic. Moreover, and . Suppose there exists an epimorphism that satisfies the condition of Equation 1 for some epimorphism . Let be the unique subgroup of whose order is . Define a subgroup of generated by the set , . It is clear that .
The following observation on 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, is a direct sum of maximal indecomposable -submodules of .
Let be an Abelian group, but not necessary elementary Abelian. A -module is a -module where the exponent of (the LCM of the orders of the elements of ) divides .
Lemma 9 ([42, Corollary 1.2]).
Let be a finite group. If is coprime to , then any indecomposable -module is generated (as an -module) by a single element.
Lemma 10.
Let be an Abelian group (not necessarily elementary Abelian), and a cyclic group acting on by automorphisms. Moreover, suppose . Then a decomposition of into its indecomposable -submodules can be computed in polynomial time in .
Proof.
For each , we compute the -submodule of . For each such submodule, we then use the algorithm of Ciocǎnea-Teodorescu [12, Theorem 1.1] to test whether appears as a direct summand in a direct sum decomposition of as an -module, and if so, to find a complement, that is, another -submodule such that . As soon as one such direct sum decomposition is found, the algorithm is then called recursively on and to see if they can be further decomposed. Furthermore, if is decomposable, then there must exist a such that is a direct summand, for must contain an indecomposable direct summand by induction on its size, and for a prime dividing , by Lemma 9, in this setting, indecomposable -modules are generated by a single element. If no such direct sum decomposition is found, then is an indecomposable -module, and the recursion stops.
In practice, some pre-processing can be done beforehand; for example, at the start, can be split into a direct sum of its Sylow -subgroups for different primes . And within each Sylow -subgroup, if for some , then is not a direct summand of and can be excluded from the above search.
We are now ready to prove Theorem 1.
Proof of Theorem 1.
First we check that is in (otherwise reject). In order to test whether there is an epimorphism between and , we first run the algorithm from [34, Theorem 1] on the inputs and to obtain all normal Hall subgroups and their complements. We then select an arbitrary normal Hall subgroup of (respectively, of ) and its complement (respectively, ) such that , , and are Abelian, and and 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 to . 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 such that . If no such exists, then the algorithm will reject. Moreover, can be computed in polynomial time. Let (respectively, ) be a conjugation action of on (respectively, on ). We compute the normal subgroup , and determine its order in polynomial time.
If then there is an epimorphism from to if and only if the groups and are isomorphic333The quotient naturally inherits the action since acts trivially on (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 to by composing the canonical epimorphism, , with the computed isomorphism from to .
Otherwise, we may assume (for if then the algorithm can simply return that there is no epimorphism). Since and is an -module, it follows that and both are an -module. Let and denote the decomposition of and into their indecomposable -submodules and -submodules, respectively. These decompositions can be computed in polynomial time by Lemma 10. Note that the underlying group of each is , for some , and the exponent of divides (see, e.g., [42, 19]). Moreover, the underlying group of the quotient is an elementary Abelian group [42].
Let be an isomorphism. All such isomorphisms can be computed in polynomial time, as both and are cyclic groups. Fix such an isomorphism . For each , the module inherits an -module structure via , since acts trivially on .
We now construct a bipartite graph as follows. The vertex set of is the disjoint union of two sets, one containing a vertex labeled for each , and the other containing a vertex labeled for each . There is an edge between vertices and if and only if there exists such that there is an -module isomorphism from to .
Claim 11.
For some there is an -module isomorphism from to if and only if there is an -modules isomorphism from to , and .
Proof of Claim 11.
Let be an -module isomorphism. Note that and are the underlying groups of and , respectively. Additionally, we have implies that and . Define by , where and . It is easy to see that is an epimorphism. Moreover, , where . Therefore, by Schur’s lemma [39, Proposition 4] we have is an -module isomorphism.
Next, we have for each , there is such that for some positive integer . This implies .
Conversely, let be an -module isomorphism and let . Let and be the underlying groups of and , respectively. Since is an isomorphism, we have . Take . By [42, Theorem 1.1], if modules and are not isomorphic then so the modules and . This completes the proof of the claim.
First, we see that the graph and the isomorphism can be constructed in deterministic polynomial time. By Claim 11, to test whether there is an -module isomorphism from to it is enough to test whether there is an -modules isomorphism from to , and that . Since the Cayley tables of the underlying groups of and can be constructed, we can compute and in polynomial time.
Both and are elementary Abelian -groups. Let be the matrices induced by an action of on and respectively. Testing whether there is an -modules isomorphism between these modules is equivalent to testing whether and are conjugate in . Since is an -algebra, this conjugacy problem can be solved in deterministic polynomial time as described in [11, Theorem 2]. Moreover, this algorithm also compute a matrix such that , if such a exists. Then is the corresponding linear map. Moreover, we can compute a module isomorphism by [12, Corollary 1.2]. Therefore, the graph and the isomorphism 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 ’s, i.e., if its size equals the number of indecomposable -modules of , then the matching defines the epimorphism from to , say (otherwise, we conclude that no epimorphism from to exists and hence there is also no epimorphism from to ). Moreover, since we have computed the homomorphism corresponding to the matched edges, we can explicitly construct in polynomial time. Note that gives an isomorphism from to since and satisfies Equation 1 by construction. Next, we lift this isomorphism to an epimorphism from to by composing the canonical epimorphism with the computed isomorphism.
5 Efficient epimorphism testing of
In this section, we solve GpEpi for groups from . 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 to SInducedRepEpivalent. By listing all normal Hall subgroups and their complements, we can find a normal Hall subgroup of (resp. of ) with complement (resp. ), such that both and are elementary Abelian -groups, both and are elementary Abelian -groups. Thus, in order to test the epimorphism of the and , we first solve the group epimorphism problem for the normal and complement parts. Since the normal and complement parts of and 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 and 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 . As discussed in Section 2, a representation , defines a group . Given two representations, and , we can construct two groups and . Since ’s are elementary Abelian -groups, both . Then we can call an oracle to test if there is an epimorphism from to . By Theorem 7, the two representations are epivalent if and only if there is an epimorphism from to , 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 over , where and are two different primes. The reader can refer to [34, Section A5] for details.
Let be the cyclotomic polynomial. Let are factors of over such that ’s are monic polynomial of same degree , where is the order of in the multiplicative group . Let be the companion matrix of . For each nonzero vector , define , and define a representation . Then is an irreducible representation of over , and is the set of all irreducible representations of over .
Let and be two representations of and let . By Maschke’s theorem (see e.g., [39, Theorem 1], both and can be written as direct sum of irreducible representations as follows, and .
Lemma 12.
With the notation above, and are epivalent if and only if for every irreducible representation of with multiplicity , there is an irreducible representation of equivalent to with multiplicity at least .
Proof.
Assume that and are epivalent. Let be a surjective linear map. Since both and are both -modules, is also a surjective -module homomorphism. By fundamental theorem of module homomorphism, we have which implies that . Thus, each appear in the decomposition of with multiplicity at least for . Conversely, if all irreducible constituents of appear in with the appropriate multiplicities, then we can define a surjective -module homomorphism by projecting onto the relevant direct summand.
Let and be two representations. Let be an irreducible representation of over , appears in the decomposition of . Let be a surjective linear transformation. Then the induced representation of by gives the representation . Moreover, , for all [34, Section 5.1].
We decompose , for , and , for into their irreducible representations such that and . This decomposition can be computed in polynomial time, as shown in [34, Proposition 2]. Consider a set of vectors in , where each appears exactly times in the set . Similarly, let of vectors in , where each appears exactly times in the set . Using and , we construct two matrices, of order , and of order .
To test if there is an epimorphism from to , where and identified as and , by Theorem 2 we can view (resp. ) as representations of (resp. of ) over of dimension (resp. ). We solve SInducedRepEpivalent problem for and .
Proof of Theorem 3.
By Lemma 12, and are epivalent if and only if for each , there exists such that is equivalent to and . This latter condition is equivalent to verifying that as each irreducible representation of is of the form for some . To test whether , it is enough to compute the linear transformation , a matrix such that each row and each column of contains at most one entry equals to (with all other entries being zero), and the equality holds. We now prove that finding such and can be reduced to an instance of Code Isomorphism.
Without loss of generality, we may assume that (resp. ). We can perform row operations on (resp. on ) followed by a permutation of the columns to transform (resp. ) to a standard form. Let (resp. ) and a permutation matrix in (similarly ) be such that (resp. ). Since is an injection matrix, we can write , where is of dimension and is a permutation matrix of dimension .
Note that the number of zero columns of can be at most the number of zero columns of , as otherwise, there can not exist and satisfying (in which case the algorithm immediately rejects). Therefore, once we get to this point, we can safely delete all the zero columns of and . Now
| (2) |
Note that . Let be the matrix such that , where is of dimension and . Let . We have . By Equation 2, there exists such that , where is of rank . It follows now from Equation 2 that
| (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 can be extended to as follows. First we check that is in (otherwise reject). For both and , we compute all the normal Hall subgroups and their complements in polynomial time by [34, Theorem 1]. Additionally, we can identify as and with the associated actions as and , respectively.
Now we need to test if there exist an epimorphism and such that . Let be the projection of into the -th component for , and let be the projection of into the -th component for . For each and , let and be the matrices arising from the irreducible representation and , respectively (see proof of Theorem 3). Define , i.e., (resp. ) is a block diagonal matrix with diagonal blocks (resp. ). Then it suffices to solve 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 is a quotient of , and let be the socle length of . Then there exist integers and groups for and for all such that
-
1.
is a minimal normal subgroup of
-
2.
There is a minimal normal subgroup of such that the natural quotient map maps isomorphically onto .
-
3.
.
Proof.
Let be such that . Let be the minimal normal subgroups of that are contained in . Then we can define to satisfy the first two parts of the lemma. Define .
Now let , and suppose inductively that , have been defined for all and all that satisfy (1) and (2) and such that are all the minimal normal subgroups of that are contained in . Define , and let be the minimal normal subgroups of that are contained in . First, we claim that they are mapped isomorphically onto their images by the natural quotient map ; call these images . For if some is not mapped isomorphically onto its image by this map, then it must be contained in the kernel of the map, hence in . But since was contained in , if it were also in , then by construction would have been contained in (since the latter is equal to ), contradicting the fact that it was a minimal normal subgroup of . Let be the image of in . Then is indeed a minimal normal subgroup of .
The above induction continues until , at which point . Since each time we progress up the socle series, this happens at some , and thus we satisfy part (3) of the lemma.
Proof of Theorem 6.
First, we check that has no Abelian composition factors (otherwise reject). Computing the composition factors in time is easy (indeed, computing the composition factors of permutation groups can even be done in [3]).
Next, we compute a chief series of 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 , hence that are at most many such subsets – we attempt to make those the kernel of an epimorphism . Say the subset we pick has for that are among the minimal normal subgroups of .
First, we check that the order is correct: if , 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 corresponding to the chosen that satisfy parts (1) and (2) of Lemma 13. If so, then we finally we compute the quotient , and test isomorphism between that group and . The latter can be done in polynomial time since 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 contains Abelian minimal normal subgroups such that the subgroup they generate is their direct product, and such that all are pairwise isomorphic as -modules, then contains many Abelian normal subgroups (normal in ) that are isomorphic to as -modules. (In the “extreme” case that the are central, they are each 1-dimensional, trivial -modules , and the previous discussion is the same as saying that a -dimensional vector space has a number of -dimensional subspaces that is .) Of course we have , but if , then , 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 , we define its multiplicity in as the largest such that there exist where all are minimal normal subgroups of such that they are all isomorphic to as -modules.
Definition 14.
The Abelian width of a group is the maximum such that there is an and an Abelian minimal normal subgroup of multiplicity .
We note that the Abelian width is always at most , and there are even Fitting-free groups that achieve this width, for example: has socle , with quotient , so its Abelian width is .
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 , prime cyclic group has distinct irreducible representations over (an extension of that has -th roots of unity), that are 1-dimensional over (hence dimension over ). If we let be the direct sum of those irreps, then the group has order , the socle is which has dimension over , each irrep has dimension over , but the Abelian width is only 1 since is a direct sum of pairwise non-isomorphic, irreducible -modules (hence, the same is true when viewed as -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 such that is Fitting-free and has Abelian width at most .
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 contains an Abelian -module of multiplicity , then instead of breaking up into its chief factors (isomorphic copies of ), we brute force over all possible copies of contained within , for , of which there are at most by our assumption that the Abelian width is . 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 ?
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.
-
2.
When the target group has size ? Or is -generated?
- 3.
- 4.
-
5.
Groups with central, elementary Abelian radicals such that is a direct product of non-Abelian simple groups (cf. [21, Thm. C])?
We comment on the Fitting-free question. If the target group is Fitting-free, then there is an epimorphism iff there is an epimorphism (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 are Fitting-free, deciding whether is a quotient of by a subgroup of doesn’t seem particularly hard; the difficulty arises when the socle of may come from chief factors that are at many different layers of the socle series of .
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 -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 -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 -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 -groups of class 2 and exponent . 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 . Journal of Algebra, 72(2):478–500, 1981.
- [43] user2661923 (https://math.stackexchange.com/users/464411/user2661923). If is the highest power of 2 which divides , show that lies between and . 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: is an Abelian group that is coprime to the cyclic group , and is an action. , and . The observation to prove is that is a direct sum of maximal indecomposable -submodules of .
Proof of Observation 8.
Let be a decomposition of into its indecomposable -submodules, . Let be the prime such that is a -group. Define . Then we immediately have . Then it is necessary and sufficient to show that whenever .
From [42, Corollary 1.2] it follows that, since is indecomposable and is coprime to , the only submodules of are of the form for some .
Let be the exponent of : and . Suppose that for some (in particular, we are assuming , as that is the only case we need to handle). Then acts trivially on . For , we have , where is an identity map and . We now prove that . We have . To show that , it is enough to show that divides for all . If then . And if then . So now consider . The power of dividing is . Thus, .
Now suppose or . Then, we have , and therefore
It follows that, .
Finally, let us now consider the case when and . It is standard that if , then [43]. Therefore, . Thus proves that . This implies that . However, since is a homomorphism, , and . Since , we get , hence . This implies that , which is a contradiction. Therefore, . This completes the proof of Observation 8.
