On the characters of Sylow $p$-subgroups of finite Chevalley groups $G(p^f)$ for arbitrary primes
Tung Le, Kay Magaard, Alessandro Paolini

TL;DR
This paper introduces a new method to parametrize irreducible characters of Sylow p-subgroups in finite Chevalley groups for any prime, including very bad primes, and applies it to G=F4(2^f).
Contribution
It develops a universal parametrization method for irreducible characters of Sylow p-subgroups applicable to all primes, including very bad primes.
Findings
Parametrization method valid for arbitrary primes p.
Explicit parametrization for G=F4(2^f).
Enhanced understanding of Sylow p-subgroup characters.
Abstract
We develop in this work a method to parametrize the set of irreducible characters of a Sylow -subgroup of a finite Chevalley group which is valid for arbitrary primes , in particular when is a very bad prime for . As an application, we parametrize when .
| Type | ||||||
|---|---|---|---|---|---|---|
| Prime | any | any | ||||
| Rep. sets | ||||||
| Form | Freq. | Branch. | Family | Label | Number | Degree |
|---|---|---|---|---|---|---|
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 | ||||||
| \cdashline4-7 |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · graph theory and CDMA systems
On the characters of Sylow -subgroups of finite Chevalley groups for arbitrary primes
Tung Le, Kay Magaard and Alessandro Paolini
T. L.: Department of Mathematics and Applied Mathematics, University of Pretoria, Pretoria 0002, South Africa
A. P.: FB Mathematik, TU Kaiserslautern, 67653 Kaiserslautern, Germany.
Abstract.
We develop in this work a method to parametrize the set of irreducible characters of a Sylow -subgroup of a finite Chevalley group which is valid for arbitrary primes , in particular when is a very bad prime for . As an application, we parametrize when .
Date: .
2010 Mathematics Subject Classification. Primary 20C33, 20C15; Secondary 20C40, 20G41.
Key words and phrases: irreducible character, Sylow subgroup, nonabelian core, arbitrary primes.
1. Introduction
The study of finite groups and their representations is a major research topic in the area of pure mathematics. An important open challenge is to determine the irreducible modular representations of finite simple groups. Particular focus has been dedicated to finite Chevalley groups.
Let be a power of the prime , and let be the field with elements. Let be a finite Chevalley group defined over . For , denote by the set of ordinary irreducible characters of . Due to the work of Lusztig, a great amount of information on has been determined, for instance irreducible character degrees and values of unipotent characters; see [1] and [3]. The problem of studying modular representations of over a field of characteristic is still wide open.
One of the approaches to this problem is to relate the modular representations of with the irreducible characters of a Sylow -subgroup of . Namely by inducing elements of to one gets -projective characters, which yield approximations to the -decomposition matrix of . This is particularly important when is a bad prime for , in that a definition of generalized Gelfand-Graev characters is yet to be formulated. Such an approach has proved to be successful in the cases of , [12] and [22]. In order to achieve this, obtaining a suitable parametrization of the set is an unavoidable step.
Another crucial motivation of this work originates from the following conjecture on finite groups of Lie type which has been suggested to us by G. Malle. The data for unipotent characters of in [1, Chapter 13] and those known for point out a strong link between the rows of -decomposition matrices of , labelled by , and their columns, labelled by suitable characters for .
Conjecture 1.1** (Malle).**
Let be a finite Chevalley group defined over with and a bad prime for , and let be a Sylow -subgroup of . Then for every cuspidal character , there exists such that .
This conjecture is verified in the following cases: [20, §7], for [17, Section 3], [7, §4.3], for and for [18], and [15]. Here, we confirm Conjecture 1.1 for . In particular, if is one of the cuspidal characters or in the notation of [1, §13.9], then , and we do find irreducible characters of of degree in the family in Table 3.
We lay the groundwork for a package in GAP4 [6], whose code is available at [16], in order to build a database for the generic character table of , in particular to find suitable replacements of generalized Gelfand-Graev characters as in [22]. Furthermore, we verify the generalization of Higman’s conjecture in [9] for the group , namely the number of its irreducible characters is a polynomial in with integral coefficients.
Theorem 1.2**.**
*Let where , and let be a Sylow -subgroup of . Then each irreducible character of is completely parametrized as an induction of a linear character of a certain determined subgroup of . In particular, we have *
[TABLE]
In this work, we first develop a parametrization of by means of positive root sets of , which is valid for arbitrary primes. This procedure generalizes the one in [7] and [18], which does not work for type when . In general, if is a very bad prime for then we lose some structural information when passing from patterns to pattern groups. In fact, let be the set of positive roots in . The product of root subgroups indexed by a certain set forms a group despite not being a pattern, see Example 3.2.
We generalize the definition of pattern and quattern groups (see [7, §2.3]) for every prime by means of the Chevalley relations of . Then every is constructed as an inflated/induced character from a quattern group of which is uniquely determined by the algorithm in Section 4. In the case when is abelian, i.e. a so-called abelian core, the character is directly parametrized. The focus of the rest of the work is then devoted to studying the nonabelian ’s, which we call nonabelian cores. In order to determine , we generalize the technique used in [18, §4.2], by constructing a graph associated to as in Section 5. When the prime is very bad, the graph may have a vertex of valency .
We remark that is the highest rank exceptional group at a very bad prime. Furthermore, the type is a good small example to fulfill our algorithm for the determination of for all primes. A parametrization of has now been determined for all primes . Namely [7, §4.3] settled the case when , and in this work we deal with the case .
We observe the following phenomenon which occurs just for among all finite Chevalley groups of rank or less. The number of irreducible characters arising from a certain nonabelian core as in Table 2 cannot be expressed as a polynomial in . In detail, the numbers of such characters do have polynomial expressions in whenever either or , that is, and respectively. However, surprisingly, the expression for the number of irreducible characters of of a fixed degree is always a polynomial in with rational coefficients.
The structure of this work is as follows. In Section 2 we recall notation and preliminary results on character theory of finite groups and Chevalley groups. In Section 3, we give the definition of pattern and quattern groups valid for all primes. In Section 4, we generalize [7, Algorithm 3.3] to obtain all abelian and nonabelian cores. We discuss in Section 5 on the method to decompose nonabelian cores. Finally, we apply in Section 6 the method previously developed to give a full parametrization of .
Authorship: The second author passed away on July 26th, 2018, shortly after the main results of the paper have been jointly obtained. The other authors of this work are deeply grateful to him for an inestimable collaboration experience and for all the insight that originated from him in detecting the distinguished behavior of and many related results.
Acknowledgment: Part of the work has been developed during visits: of the second author at the University of Pretoria and at the University of KwaZulu-Natal in June 2018, supported by CoE-Mass FA2018/RT18ALG/007; of the second author in June 2018 and of the first author in January 2019 at the Technische Universität Kaiserslautern, supported by the SFB-TRR 195 “Symbolic Tools in Mathematics and their Application” of the German Research Foundation (DFG) and NRF Incentive Grant; and of the third author in September and October 2018 at the Hausdorff Institute of Mathematics in Bonn during the semester “Logic and Algorithms in Group Theory”, supported by a HIM Research Fellowship. The third author acknowledges financial support from the SFB-TRR 195. We would like to thank E. O’Brien for the computation of for . We are grateful to G. Malle for his continuous support, comments and discussions on our project.
2. Preliminaries
We present in this section some definitions and well-known results on the character theory of finite groups and on the theory of finite Chevalley groups.
We consider in this work only complex characters. Notation and fundamental results are taken from [13]. Let be a finite group. We denote by the set of irreducible characters of . The centre and the kernel of the character are denoted by and respectively. For with , we denote by the inflation of to . For , we denote by the restriction of a character to , and by or the induction of a character of to . Moreover, we define
[TABLE]
For , and , we denote by the element , and by the element of defined by . This defines an action of on . By [7, §2.1], if is a subgroup of the centre of such that , then the inflation from to defines a bijection between the sets and for every .
The main references used for the basic notions of finite Chevalley groups are [2], [3] and [21]. Let be a prime, and let be an algebraically closed field of characteristic . Fix a positive integer , let , and let be the automorphism of defined by . Then we denote by the field with elements defined by .
Let be a simple linear algebraic group defined over , and let be a standard Frobenius morphism of such that . A Chevalley group is the finite group defined as the set of fixed points of under . From now on, we fix an -stable maximal torus of and an -stable Borel subgroup of containing . Let be the unipotent radical of . Then , and correspondingly , where and are the fixed points under of and respectively. If is a group of type and rank , i.e. , then the group will be also denoted by in the sequel.
Let be the root system of corresponding to the chosen , and let be the rank of . Let be the subset of all positive simple roots of with respect to the choice of , whose enumeration agrees with the records of GAP4 [6]. Let be the set of positive roots of , and . Recall the partial order on , defined by if and only if is a positive combination of simple roots. We then choose an enumeration of the elements of , in such a way that whenever , which also agrees with the enumeration in GAP4.
For every there exists a monomorphism satisfying the so-called Chevalley relations (see [8, Theorem 1.12.1]). We denote by (resp. ) the root subgroup of (resp. ) corresponding to , defined as the image under of (resp. ). For , we usually write and in place of and respectively. For every and , we recall the Chevalley commutator relation
[TABLE]
where are certain nonzero structure constants. In particular, is the product in any order of all its root subgroups.
The prime is said to be very bad for if it divides some . This happens if and only if in types , , and or in type . In these cases, some are actually equal to . In all other cases, we have . The prime is called bad for if it divides one of the coefficients in the decomposition of the highest root in as a linear combination of . A prime which is bad for is also very bad for . The primes for types and with , for types and with , and for type are all the bad primes which are not very bad. A prime is called good for when it is not a bad prime for .
Finally, we describe some properties of nontrivial irreducible characters of . Let be the field trace with respect to the extension of . From now on, and for the rest of the work, we fix the irreducible character of defined by . Then . Every other nontrivial irreducible character of is of the form , where and is the automorphism of defined by multiplication by . It is easy to see that .
3. Pattern and quattern groups for all primes
In [11, Section 3] and [7, §2.3], the notion of patterns and quatterns, defined when is not a very bad prime for , are of major importance for the development of the methods for parametrizing . We now define the following generalization of pattern groups and normal pattern groups for arbitrary primes.
Let with be a subset of . We define
[TABLE]
Considering each element in as an -tuple, we have . Further, if is a group then it is independent on the order of the ’s in . Here the ’s are usually ordered by increasing indices if not specified otherwise. So the set is well-defined under this order setup. We are mostly interested in those subsets of such that is a group.
Proposition 3.1**.**
Let with . Then is a group if and only if for every and every we have
[TABLE]
Proof.
For this proof, we write as and arrange positive roots in in decreasing order. It suffices to prove the converse of the above statement by induction on . Let us assume that for each and . Recall that is a group itself for all . The claim clearly holds for . For some , it is enough to show that for all . Write and for some and . We have
[TABLE]
By the decreasing order of positive roots in , we notice that for all . Due to the formula , we have by induction hypothesis. Thus, . ∎
If the conditions of Proposition 3.1 are satisfied, we say that is a pattern group.
Example 3.2**.**
Consider , and let (resp. ) be its long (resp. short) simple root. Let . Then is a pattern group if and only if . Notice that is not a pattern in the sense of [11, Definition 3.1].
We would like to have a notion of normality of pattern groups. By applying the same method as in the proof of Proposition 3.1, it is straightforward to prove the following.
Proposition 3.3**.**
Let be such that is a pattern group. Assume . Then is a normal subgroup of if and only if for every and and every we have
[TABLE]
Under the assumptions of Proposition 3.3, we say that is a normal pattern subgroup of the pattern group .
Example 3.4**.**
Consider , and let (resp. ) be its long (resp. short) simple root. Set and . Then is a normal pattern group of if and only if (see [17, §3] for a full parametrization of ). Notice that is not a normal pattern in in the sense of [11, Definition 3.2].
Pattern groups over bad primes can readily be determined by using GAP4 in terms of the behaviour of the positive roots. We highlight this in the following proposition.
Proposition 3.5**.**
Let , and assume is a very bad prime for .
The set is a pattern group if and only if for every , we have that
[TABLE]
- 2)
Let be a pattern group. Then is a normal pattern subgroup of if and only if for every and , we have that
[TABLE]
Proof.
This comes directly from Equation (2.1) and the fact that all the structure constants and vanish for every when (see [2, Chapter 4]). ∎
Let be a pattern group, and let be a normal pattern subgroup of . If , we put and we call it the corresponding quattern group. Given such a set , define
[TABLE]
and
[TABLE]
For fixed , define
[TABLE]
We recall the following formula (see [18, Equation (3)]),
[TABLE]
Fixed a character , define
[TABLE]
Proposition 3.6**.**
Let . Then is a normal pattern subgroup of .
Conversely, let be such that is a normal pattern subgroup in . Then there exists such that .
Proof.
Let . For every and , we claim that for all ; this of course would imply . We have . Due to the properties of , it suffices to prove that for the cases the claim is true for all irreducible constituents of .
By [17, §3], the first statement holds for of type at any prime. From the fact that and that is partitioned by positive root sets as in [17, §3], if then both and are contained in ; thus, the claim follows.
For the converse, let be such that is a normal pattern group in . Set , and by slight abuse of notation write instead of for every root subgroup . Let be such that for all . By properties of induction, for every constituent we have for all . Thus, . So the inflation of to satisfies . ∎
We now determine a partition of in terms of the so-called representable sets. We call a representable set if for some such that . Notice that if and for , then if and only if . Hence given a representable set , we can define to be the unique set corresponding to a normal pattern group of such that . For a representable set , denote
[TABLE]
Remark 3.7*.*
When is not a very bad prime for , then the definition of representable sets given in this work is consistent with [11, Section 5].
The desired partition follows by Proposition 3.6 and the uniqueness of for every .
Proposition 3.8**.**
We have that
[TABLE]
Finally, we remark that all representable sets in low rank are determined by computer algebra. Namely these are in bijection with normal pattern groups in , and Proposition 3.5 gives a criterion to check whether a subset of gives rise to a normal pattern group in . In this way, it is immediate to produce an efficient algorithm in GAP4 whose input is a record of the Chevalley relations and that gives all representable sets; see the function repSetAll in our GAP4 code in [16].
We collect the numbers of representable sets in rank in Table 1. Notice that these numbers are the same as in [11, Table 2] when is not a very bad prime for , namely they coincide with the numbers of antichains in . On the other hand, fixed a type in Table 1 for which is a very bad prime, we see that the number of representable sets for and for is considerably different.
4. Reduction algorithm
We develop in this section a reduction algorithm for the study of the sets with representable, which is an adaptation of [7, Algorithm 3.3]. Namely we establish a bijection between a set of the form , with , and a set , with , where . More precisely, our goal is to develop an algorithm which takes as input, and outputs the following decomposition,
[TABLE]
where each of the sets is a tuple of positive roots, and the sets and are a measure for the complication of the parametrization of the characters of .
The set contains all families of characters whose parametrization is immediately provided by the algorithm. The remaining families in , whose study requires more work, almost always highlight a pathology of the group at very bad primes. For example, they often contain characters whose degree is not a power of . The families in shall be in turn reduced to few enough cases to be studied in an ad-hoc way.
We introduce the following notation, in a similar way as in [7, §2.3]. Assume that is a quattern group with respect to and for . If and , for we define to be the inflation from to , and if we put . If and , for we define to be the induction from to , and if we put .
We need the following adaptation of [7, Lemma 3.1]. The proof repeats mutatis mutandis.
Proposition 4.1**.**
Let be such that is a quattern group, and let . Suppose that there exist and satisfying:
* for some and ,*
- 2)
* for all , and*
- 3)
* for every .*
Define , and . Then is a pattern group and , i.e. is a quattern group. Moreover, we have a bijection
[TABLE]
by inflating over and inducing to over .
We now proceed to illustrate the adaptation of [7, Algorithm 3.3]. At each step, we assume that the tuple is constructed and currently taken into consideration.
- Input.
Our input is a representable set . We initialize by putting , , and and .
- Step 1.
If , then is abelian and the set is parameterized as
[TABLE]
where is a linear character of supported on as in [7, Lemma 3.5] and [18, §2.4]. The family arising from is therefore completely parametrized and we add the element to .
- Step 2.
If and at least one pair of positive roots satisfies the assumptions of Proposition 4.1, then we choose from those the pair to be the unique pair having minimal among the ones having maximal (with respect to the linear ordering on ), and we put , with
[TABLE]
Then by Proposition 4.1, we have a bijection
[TABLE]
We go back to Step 1 with in place of .
- Step 3.
If , if no pair of positive roots satisfies Proposition 4.1, and if , then in a similar way as [18, §2.4], we choose the maximal element in , and we put
[TABLE]
Then we have that
[TABLE]
and we go back to Step 1 carrying each of
[TABLE]
- Step 4.
If the tuple is such that , no pair of positive roots satisfies Proposition 4.1 and , then we add to .
The elements of the form of the set (resp. ) are called the abelian (resp. nonabelian) cores of , as the corresponding groups are abelian (resp. nonabelian). As in [18], we sometimes write in short for the core .
In a similar way as [18, §2.4], given a nonabelian core as above we identify, by slight abuse of notation, the sets and with and respectively. Namely we have that , hence
[TABLE]
and the set is readily parametrized since is abelian.
We say that a nonabelian core corresponding to and is a -core if
- •
,
- •
, and
- •
there are exactly pairs with corresponding to nontrivial Chevalley relations in , i.e. such that for all and .
We also say that the triple is the form of the core . Recall that nonabelian core forms can be easily read off from the output of the algorithm described above and implemented in GAP4.
We finish by recalling the forms in groups of rank . For type there are no nonabelian cores at any prime. As in [7, Section 4], there is just one -core in type for and in type for arbitrary primes, there are nonabelian cores of different forms in type for , and there are no nonabelian cores in type for . In the case of we have nonabelian cores of the form , one -core and one -core. Finally, we collect in the first two columns of Table 3 the triples giving rise to a nonabelian core of and the number of cores of a fixed form.
Remark 4.2*.*
In contrast with [18, Theorem 4], we have that two cores with the same form are not necessarily isomorphic. Namely we see from Table 3 that in the cores of the form split into at least two isomorphism classes, since the sets of the form are evidently different, and so do cores of the form and .
On the other hand, it is easy to check that whenever is a very bad prime for , any core of the form is isomorphic to the -core of the form corresponding to and . Its study is well-known, see for instance [20, §7]. Thus is the Chevalley group of minimum rank in whose Sylow -subgroup we find non-isomorphic -cores.
5. Reducing nonabelian cores
By virtue of Section 4, the focus from now on is on the study of the families where is a nonabelian core. Our methods will involve again inflation and induction from smaller subquotients. The groups involved in our procedure need not be root subgroups anymore. In particular, we need to deal with diagonal subgroups of products of root subgroups of . In order to do this, we need the following result from [18, §4.1], which we recall here in a more compact form.
Proposition 5.1**.**
Let be a finite group. Let , and let be a transversal of in . Assume that there exist subgroups and of , and , such that
- (i)
* is a central subgroup of ,*
- (ii)
* is a central subgroup of ,*
- (iii)
,
- (iv)
, and
- (v)
* has a complement in .*
Let , and let . Then is a subgroup of such that , and we have a bijection
[TABLE]
Throughout the rest of the work, we keep the notation of Proposition 5.1 for the group , its subquotients and satisfying assumptions (i)–(v). These will be specified in each case taken into consideration. We use the terminology of [18, Definition 10] and we call and an arm and a leg of respectively, and and a candidate for an arm and a candidate for a leg in respectively.
In the case when , the check of the validity of the assumptions of Proposition 5.1 translates into a condition on the underlying set of positive roots involved, which can be carried out by computer investigation. In particular, [18, Corollary 13] generalizes in the following way when is a very bad prime for .
Corollary 5.2**.**
Let be such that is a quattern group. Assume that there exist subsets , and of , such that
- (0)
* is a quattern group,*
- (i)
,
- (ii)
,
- (iii)
, and
- (iv)
if and , then .
Let us put , , and . In the notation of Proposition 5.1, we have a bijection
[TABLE]
Let be a fixed nonabelian core. In order to find sets and as in Corollary 5.2, we define the following generalization of the graph in [18, §4.2]. Define a graph in the following way. The vertices are labelled by elements in , and there is an edge between and if and only if for some .
We have the notion of connected components and circles in as in [18, §4.2]. The heart of , which we usually denote by , is the set of roots in whose corresponding vertex in has valency zero. We say that is a heartless core if .
In Chevalley groups of rank or less, the shape of each connected component of with at least one edge is verified to be as follows. We have either a linear tree, or a union of circles together with possibly few subgraphs isomorphic to linear trees which share with it exactly a vertex (see the second graph in Figure 1). In particular, the shape of the graph is different from the ones of the graphs obtained in [18, §4.2] due to the existence of vertices of valency ; these correspond to roots which form a –subsystem with its unique neighbor in . Hence we need a new method to define the sets and .
We assume, without loss of generality, that is a connected graph with at least one edge. We now construct uniquely defined candidates for the sets and in this case, such that . The reason why such constructed and are likely to satisfy the assumptions of Corollary 5.2 lies in the fact that the induced graph has no edges. That is, no elements of are connected to each other. In fact, as in [18, Remark 14], if is a heartless core then such and do indeed satisfy the conditions of Corollary 5.2.
We recall the natural notion of a distance defined on the vertices of a linear tree . Let and be two vertices in . If then we put . Assume that . Then we define if and only if there exist edges for , such that , , and if .
The construction of and is as follows. We first assume that is a linear tree with set of vertices .
- •
Let be the maximal root in with respect to the previously fixed linear ordering of . Then we set , and for each we define
[TABLE]
Finally, we define
[TABLE]
We now assume that the union of all circles in is nonempty.
- •
We first follow the same procedure as [18, §4.2], namely we suitably enumerate the distinct circles , , of and we construct the sets and accordingly, such that .
- •
Let be the set of subgraphs attached to and isomorphic to linear trees. As previously remarked, if then and share a unique vertex, say . Let be the set of vertices of . If , then we set , and for each we define
[TABLE]
Otherwise, we have that since . In this case, we set , and for every we define
[TABLE]
We then put
[TABLE]
- •
Finally, we define
[TABLE]
The general ideas of the construction just outlined are summarized in the two examples in Figure 1 which relate to the families and of in Table 3.
We easily check, as remarked beforehand, that if then the and satisfy the assumptions of Corollary 5.2. Moreover, all the nonabelian cores arising in rank or less at very bad primes are heartless, except the -core in which has been studied in [10] already; it is an immediate check that the and previously defined satisfy the conditions of Corollary 5.2 in this case as well. In the same fashion as [18, Lemma 18] (see the function findCircleZ in [16]), we get the following result by a GAP4 implementation.
Lemma 5.3**.**
Let be a finite Chevalley group of type and rank , and let be a nonabelian core of . If , and if is a very bad prime for , then the sets and constructed as above satisfy the assumptions of Corollary 5.2.
We conclude this section with an equality that will be repeatedly used in the sequel. Let us take a nonabelian core , and let and be constructed as in Corollary 5.2. In order to determine and , we need to study the equation for and . Its general form is
[TABLE]
for some and . Hence we have
[TABLE]
and
[TABLE]
Remark 5.4*.*
Recall that all nonabelian cores in , except the well-known -core described in [7, §4.3], are heartless. That is, every index of a root in is involved in Equation (5.1). Our focus for the rest of the work will be therefore on the determination of the solutions of Equation (5.1), which is enough to completely determine a parametrization of in the case of heartless cores.
Remark 5.5*.*
Although two -cores are not always isomorphic, we can still group them by means of Equation (5.1). Namely it is easy to see that two heartless cores for which Equation (5.1) is the same up to a permutation of indices determine the same numbers of irreducible characters and corresponding degrees. We will say in the sequel that such cores have the same branching.
We collect in the third column of Table 3, for a fixed form , the number of cores in of that form that have the same branching. In general, this considerably decreases the number of nonabelian cores to study. For example, we see from Table 3 that it is sufficient to study pairwise non-isomorphic nonabelian cores in type when .
6. The parametrizations of and
As an application of the method previously developed, we give the parametrization of when . The labelling for the positive roots and the Chevalley relations are as in [7, §2.4]. In this case, we have representable sets. The characters of abelian cores are immediately parametrized via the algorithmic procedure of Section 4; in fact, such characters had already been parametrized in [5]. We are left with examining nonabelian cores, which by Remarks 4.2 and 5.5 can in turn be reduced to the study of families only. We parametrize every character arising from nonabelian cores.
Theorem 6.1**.**
All characters arising from nonabelian cores of are parametrized, and their branchings into families of are listed in Table 3.
We now explain how to read Table 3. The first column collects all the triples that arise as forms of nonabelian cores as in Section 4. The second column collects the number of occurrences of a core of a fixed form, and the third column describes their branching as explained in Remark 5.5. Fixed a family , we gather in the fourth column of Table 3 the families where is the number of different branchings. The different labelling for each is reflected in the fifth column. This collects labels for an irreducible character of each family obtained as inflation/induction from an abelian subgroup of , which is not necessarily a product of root subgroups and whose structure can be reconstructed by the indices of the labels. The convention for the letters , , , for such labels and their precise meaning are explained in [18, Section 5]. Finally, we collect in the sixth column the number of irreducible characters of , and in the seventh column their degree.
The pathology of the case when is quite rich. Notice that if and only if , and if and only if . For the first time in the study of any of the sets , the parametrization is different according to the congruence class of modulo . In fact, the families , and yield different numbers of characters according to whether is even or odd. The expression of when is one of these families is not polynomial in , but PORC (Polynomial On Residue Classes) in . Surprisingly, the global numbers of irreducible characters of of fixed degree are the same for every in both cases of odd and even. As remarked in the Introduction, an interesting research problem is to find an insightful explanation of this phenomenon.
The number of irreducible characters of a fixed degree are collected in Table 2. In particular, the degrees of characters in are: for ; for ; for ; and . This is the example of smallest rank that yields a character of of degree when .
Finally, we point out that the analogue over bad primes of [14, Conjecture B] which generalizes [19, Conjecture 6.3] does not hold for the group . In fact, the number cannot always be expressed as a polynomial in with non-negative integral coefficients. Moreover, . A similar phenomenon happens when [7, Table 3], in that . If then the expression of every is in .
Except for the -core, whose parametrization is as for in [10, Table 2], all the other cases in Table 3 correspond to heartless cores. Let be one such core. We apply the method in Section 5 to find and ; these are readily computed thanks to our implemented function findCircleZ in GAP4 [16]. Then and can be determined by means of the study of Equation 5.1. As in [18, §5.1], if is an abelian subgroup then the characters in are immediately parametrized by inflating over and inducing to . This is the case for all remaining families in Table 3 except and ; hence the only computation we have to do in these cases is to solve Equation (5.1). The remaining two families yield and is not a subgroup of . The study of the family remains uncomplicated as the associated graph has in this case just three edges. The study of the family presents more complications and will be examined in full details.
We include in this work the complete study of three important families of characters arising from nonabelian cores, namely:
- •
the family corresponding to a -core, which provides the smallest example where the expression of the cardinality of a family is PORC, but not polynomial,
- •
the family corresponding to a -core, where is not a subgroup, which presents a more intricate branching and contains characters of degree , and
- •
the family corresponding to a -core, whose study requires the determination of solutions of complete cubic equations over .
The difficulty of the computations related to all other families in Table 3 is bounded by that of the three families described above. Full details in these cases can be found in [16].
Before we start, we recall the following notation. For any and , we define
[TABLE]
Notice that is a cyclic group. We focus on the set when . It is easy to check that if then , while if then .
We first study a nonabelian -core arising from the family in Table 3. In this case, we have
- •
,
- •
,
- •
and ,
- •
and .
Proposition 6.2**.**
The irreducible characters corresponding to the family in are parametrized as follows:
- •
If , then
[TABLE]
where
- –
* consists of irreducible characters of degree , and*
- –
* consists of irreducible characters of degree .*
- •
If , then consists of irreducible characters of degree .
The labels of the characters in , and in are collected in Table 3.
Proof.
Here, Equation (5.1) has the form
[TABLE]
Hence we have
[TABLE]
and
[TABLE]
Let us assume that . If , that is, for choices of in , then the quartic equations involved in the definitions of and just have a trivial solution. In this case, we have and , and we get the family as in Table 3.
If , i.e. for choices of in , then there are three distinct values for , such that . In this case, we have
[TABLE]
and
[TABLE]
We now observe that and are each isomorphic to . We get the family as in Table 3. By Equation (3.1), we readily check that
[TABLE]
This proves the first claim of the proof.
Let us now assume that . Let be the unique cube root of . Then we get
[TABLE]
Hence we obtain the family as in Table 3, completing our proof. ∎
We then move on to study the family in Table 3, corresponding to nonabelian cores of the form . Here we have
- •
,
- •
,
- •
,
- •
and .
Proposition 6.3**.**
The irreducible characters corresponding to the family in are parametrized as follows:
[TABLE]
where
- •
* consists of irreducible characters of degree , and*
- •
each of for consists of irreducible characters of degree .
The labels of the characters in for are collected in Table 3.
Proof.
The form of Equation (5.1) is
[TABLE]
We have that
[TABLE]
and
[TABLE]
Hence we have that
[TABLE]
and
[TABLE]
with in a natural way with , , and and with , , and . Now notice that is not always a group, namely we have
[TABLE]
Thus we have for every with .
For we call the extension of to such that for every and . An inflation and induction procedure from groups of order induces then a bijection
[TABLE]
Let us assume for every . Then we can apply Proposition 5.1 with arm and leg . In this case, we get a bijection
[TABLE]
and is abelian. Hence we get the family as in Table 3.
Let us now assume that and for any . Proposition 5.1 applies here with arm and leg . We have a bijection
[TABLE]
with abelian. This gives the three families , and as in Table 3.
Let us then assume that , and for any . Proposition 5.1 now applies with arm and leg . We have a bijection
[TABLE]
with abelian. This gives the three families , and as in Table 3.
Finally, let us assume . Then we have that
[TABLE]
is a bijection, and is abelian. We have determined our family of irreducible characters of degree as in Table 3.
Equation (3.1) now yields
[TABLE]
proving our claim. ∎
We conclude our work by expanding the computations for the parametrization of the unique -core, which corresponds to the family in Table 3. As previously remarked, we need some properties of solutions of cubic equations in . For , let
[TABLE]
Define the map such that , and for let us put
[TABLE]
By [4, Equation (1.1)] and the fact that implies for every , we have that
- •
,
- •
, and
- •
.
In particular, we have
[TABLE]
The next result follows directly by the explicit description of for and a case-by-case discussion. We omit the lengthy, but straightforward proof.
Lemma 6.4**.**
Let
[TABLE]
and for every , let , and
[TABLE]
Then we have that
[TABLE]
Remark 6.5*.*
The expressions of , and in Lemma 6.4 as polynomials in for even and odd are different. This is reflected in the sixth column of Table 3 for the -core, and explains a difference in the parametrization of the family in these two cases.
We return to the study of the family . In this case,
- •
,
- •
,
- •
and ,
- •
and .
Proposition 6.6**.**
The irreducible characters corresponding to the family in are parametrized as follows:
- •
If , then
[TABLE]
where
- –
* consists of irreducible characters of degree ,*
- –
* consists of irreducible characters of degree ,*
- –
* consists of irreducible characters of degree ,*
- –
* consists of irreducible characters of degree ,*
- –
* consists of irreducible characters of degree ,*
- –
* consists of irreducible characters of degree , and*
- –
* consists of irreducible characters of degree .*
- •
If , then
[TABLE]
where
- –
* consists of irreducible characters of degree ,*
- –
* and consist of irreducible characters of degree ,*
- –
* consists of irreducible characters of degree ,*
- –
* consists of irreducible characters of degree , and*
- –
* consists of irreducible characters of degree .*
The labels of the characters in for and in for are collected in Table 3.
Proof.
The form of Equation (5.1) is
[TABLE]
We have that
[TABLE]
and
[TABLE]
We now focus on the determination of . Analogous computations can be carried out in order to determine . We omit the details in the latter case, just mentioning that the cubic equations that show up in the study of and , which depend on for , have the same number of solutions for each of the fixed values of the ’s in .
Let us fix , and in . By combining the equations defining , we substitute the value of as a function of into the first equation. Let us put , and . Then we get
[TABLE]
Since is an abelian subgroup of , and is determined in a similar way as previously remarked (in particular, ), then each choice of for such that Equation (6.1) has solutions yields irreducible characters of degree . The claim follows if we determine the number of solutions of Equation (6.1) for every .
Let us first assume that ; this happens for values of . In this case, Equation 6.1 is and just has the solution . In this case, we get the family as in Table 3.
Let us then assume that and ; this happens for values of . In this case, Equation 6.1 is , where , and we see that its two distinct solutions are [math] and the unique square root of . This gives the family as in Table 3.
We now assume that and ; this happens for values of . Equation 6.1 writes , where . If , then has a unique cube root and the equation has two distinct solutions. This gives the family as in Table 3. Let us then assume that . We distinguish two cases in turn. We first suppose that ; this happens for values of . In this case, has three distinct cube roots, and Equation 6.1 has four distinct solutions. This gives the family as in Table 3. Assume then that ; this happens for values of . In this case, has no cube roots. Therefore, Equation 6.1 only has the solution , which yields the family as in Table 3.
Finally, we assume that and . Then we are in the assumptions of Lemma 6.4 by setting , and . We readily get the families and as in Table 3 when , and the families and as in Table 3 when , in the cases when the equation
[TABLE]
has [math], or solutions respectively.
Since
[TABLE]
the claim is proved. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. W. Carter , Finite groups of Lie type: Conjugacy classes and complex characters , vol. 44, Pure Appl. Math., 1985.
- 2[2] , Simple groups of Lie type , vol. 22, John Wiley & sons, 1989.
- 3[3] F. Digne and J. Michel , Representations of finite groups of Lie type , vol. 21, Cambridge University Press, 1991.
- 4[4] H. Enomoto and H. Yamada , The characters of G 2 ( 2 n ) subscript G 2 superscript 2 𝑛 \mathrm{G}_{2}(2^{n}) , Japan. J. Math. (N.S.), 12, no. 2 (1986), pp. 325–377.
- 5[5] U. Faltings , On the characters of the Sylow 2 2 2 -subgroup of F 4 ( 2 n ) subscript F 4 superscript 2 𝑛 \mathrm{F}_{4}(2^{n}) and decomposition numbers , Dissertation, TU Kaiserslautern, (2018).
- 6[6] The GAP Group , GAP – Groups, Algorithms, and Programming, Version 4.10.0 , 2018.
- 7[7] S. M. Goodwin, T. Le, K. Magaard, and A. Paolini , Constructing characters of Sylow p 𝑝 p -subgroups of finite Chevalley groups , J. Algebra, 468 (2016), pp. 395–439.
- 8[8] D. Gorenstein, R. Lyons, and R. Solomon , The classification of the finite simple groups. Number 3 , vol. 40, American Mathematical Society, Providence, RI, 1998.
