Computing Green functions in small characteristic
Meinolf Geck

TL;DR
This paper introduces a computational method to determine Green functions for certain exceptional Lie type groups in small characteristics, solving previously open cases using reduction and computer algebra techniques.
Contribution
It presents a new general approach that reduces complex cases to prime q and employs computer algebra, successfully resolving open problems in exceptional groups.
Findings
All open cases in ${^2 ext{E}_6}$ and $E_7$ are solved.
At least one open case in $E_8$ is resolved.
The method generalizes to small characteristic cases for exceptional groups.
Abstract
Let be a finite group of Lie type over a field with elements, where is a prime power. The Green functions of , as defined by Deligne and Lusztig, are known in \textit{almost} all cases by work of Beynon--Spaltenstein, Lusztig und Shoji. Open cases exist for groups of exceptional type , , in small characteristics. We propose a general method for dealing with these cases, which procedes by a reduction to the case where is a prime and then uses computer algebra techniques. In this way, all open cases in type , are solved, as well as at least one particular open case in type .
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.
Computing
Green functions in small characteristic
Meinolf Geck
IAZ - Lehrstuhl für Algebra, Universität Stuttgart, Pfaffenwaldring 57, D–70569 Stuttgart, Germany
To the memory of Kay Magaard
(Date: April 10, 2019)
Abstract.
Let be a finite group of Lie type over a field with elements, where is a prime power. The Green functions of , as defined by Deligne and Lusztig, are known in almost all cases by work of Beynon–Spaltenstein, Lusztig und Shoji. Open cases exist for groups of exceptional type , , in small characteristics. We propose a general method for dealing with these cases, which procedes by a reduction to the case where is a prime and then uses computer algebra techniques. In this way, all open cases in type , are solved, as well as at least one particular open case in type .
Key words and phrases:
Finite groups of Lie type, Green functions, character sheaves
1991 Mathematics Subject Classification:
Primary 20C33; Secondary 20G40
1. Introduction
Let be a group of Lie type over a finite field with elements. We are concerned with the problem of computing the Green functions of , as defined by Deligne and Lusztig [5]. This is an important and essential part of the more general problem of computing the whole character table of ; see Carter’s book [3] for further background. There is a long tradition of work on Green functions; the principal ideas and methods, which remain valid and state of the art as of today, are summarized in Shoji’s survey [36] from 1987. At that point, the Green functions where known in all cases where is a power of a good prime for , or where is arbitrary, is of small rank and the whole table of unipotent character values is available (like for , , , ). Subsequently, explicit results for , , in small characteristics were obtained by Malle [27], [28] and Porsch [33].
Regarding the general theory, it was first shown by Lusztig [22] (with some mild restrictions on ) and then by Shoji [37], [38] (in complete generality) that the original Green functions of [5] can be identified with another type of Green functions defined in terms of Lusztig’s character sheaves [21]. This provides new, extremely powerful tools. In this setting, groups of classical type in characteristic are dealt with by Shoji [40]. Thus, the remaining open cases are as follows:
[TABLE]
for any . (See Marcelo–Shinoda [29] for some comments about the Green functions of .) In principle, one could try to deal with these cases by similar methods as in the papers by Malle and Porsch mentioned above; however, these involve the technically complicated and unpleasant task of explicitly inducing class functions from proper subgroups. In this paper, we use another approach, similar to that in [11]. By [12, Theorem 3.7], the computation of the Green functions of , where with , can be reduced to the base case where which amounts to just six individual cases which can be addressed by computer algebra methods. In this way, we will solve all the open cases for the groups of type , in the list (), as well as one particular case for type in characteristic .
In Section 2, we review the general plan for computing Green functions, which reduces matters to the determination of certain “-functions”. In Section 3, we discuss a number of techniques for determining these functions. Consequently, we obtain a method for solving the remaining open problems which relies on knowing at least some values of the permutation character of on the cosets of a Borel subgroup . In order to compute such values, we shall work with an explicit realisation of as a matrix group. In Section 4, we advertise a “canonical” way of constructing , following [8], [25]. Then the remaining sections deal with the discussion of the various cases in groups of type , , , ; see Section 9 for the particular case in type .
We heavily rely on Michel’s version of CHEVIE [30], as well as programs (written by the author in GAP [6]) implementing the constructions in Section 4. As far as the remaining open cases in type are concerned, it seems that the above method might work in principle, but more sophisticated algorithms will certainly be required. (For example, one could replace the Borel subgroup by a parabolic subgroup of .) This will be discussed elsewhere.
The main computational challenge of our approach is the explicit computation of the values of the above-mentioned permutation character of . For this purpose, we need to count the (left) cosets of that are fixed by a given element . But, because of the sheer size of the groups in question (e.g., for we have ), it is entirely impossible to run through the complete list of cosets. Now a crucial feature of our approach is that, typically, we only need to obtain lower bounds for the number of fixed points, and this can be exploited as follows. By the sharp form of the Bruhat decomposition, we have a partition
,
where is the Weyl group of and each double coset contains precisely left -cosets; here, is the length of . Now we simply begin with various elements of relatively small length, run through the left cosets that are contained in , and check if they are fixed by or not. In a sense, we were just lucky because in all cases that we consider, this is sufficient to reach the desired lower bounds for the total number of fixed points — and there are cases where we never reached the exact total number, even after weeks or months of computations. (We will indicate the maximum length required for Weyl group elements in all cases in Sections 5–9.)
Acknowledgements. The author is indebted to Gunter Malle for a careful reading of the manuscript and for a number of useful comments. This work is a contribution to the SFB-TRR 195 “Symbolic Tools in Mathematics and their Application” of the German Research Foundation (DFG).
2. On the computation of Green functions
Let be a prime and be an algebraic closure of the field with elements. Let be a connected reductive algebraic group over and assume that is defined over the finite subfield , where for some . Let be the corresponding Frobenius map. Let be an -stable Borel subgroup and be an -stable maximal torus. Let be the corresponding Weyl group. For each , let be the virtual representation of the finite group defined by Deligne–Lusztig [5, §1]. (In the setting of [3, §7.2], we have for , where is an -stable maximal torus obtained from by twisting with , and stands for the trivial character of .) This construction is carried out over , an algebraic closure of the -adic numbers where is a prime not equal to . The corresponding Green function is defined by
[TABLE]
where denotes the set of unipotent elements of . It is known that for all ; see [3, §7.6]. So the character formula [3, 7.2.8] shows that we also have for all . The general plan for computing the values of is explained in [20, Chap. 24], [36, §5], [39, 1.1–1.3] (even for generalised Green functions, which we will not consider here). In order to be able to address the main open issues, we will have to go through some of the steps of that plan, where we streamline the exposition as much as possible and concentrate on the algorithmic aspects.
Remark 2.1**.**
The Frobenius map induces an automorphism of which we denote by . Let be the set of irreducible representations of over (up to isomorphism). Let be the set of all those that are -invariant, that is, there exists a bijective linear map such that for all . Note that is only unique up to scalar multiples but, if has order , then one can always find such that
[TABLE]
see [17, 3.2]. In what follows, we assume that a fixed choice of satisfying the above conditions has been made for each . (For example, one could take the “preferred” choice for specified by Lusztig [19, 17.2].)
For , the corresponding almost character is the class function defined by
[TABLE]
Since all the terms are integers, all the values are in . By [17, 3.9], the above functions are orthonormal with respect to the standard inner product on class functions of . Furthermore, by [16, 3.19], we have
[TABLE]
Hence, knowing the values of all Green functions is equivalent to knowing the values of all on . We define the matrix where
[TABLE]
here, denotes an -stable maximal torus obtained from by twisting with and the maps , are as above.
Proposition 2.2** (Orthogonality relations).**
For , we have
[TABLE]
Proof.
Arguing as in [16, 3.19], the above relations are a formal consequence of the orthogonality relations for the Green functions in [3, Prop. 7.6.2]. ∎
Let be the set of all pairs where is a unipotent class in and is a -equivariant irreducible -local system on (up to isomorphism). The Springer correspondence defines an injective map
[TABLE]
see Lusztig [18], [20, Chap 24], and the references there. Let and . Then we define
[TABLE]
Note that for . Furthermore, since is always even and so is ; see [3, §5.10] and the references there. Now assume that . Then and . We define a function
[TABLE]
as follows. Let . Then we set if , and
[TABLE]
Now we can state the following fundamental result.
Theorem 2.3** (Lusztig, Shoji).**
In the above setting, the following hold.
- (a)
The functions are integer-valued and linearly independent.
- (b)
There are unique coefficients (* such that*
[TABLE]
- (c)
We have ; furthermore, if and .
Proof.
By Lusztig [22] (with some mild restrictions on ) and Shoji [37], [38] (in complete generality), the original Green functions of [5] can be identified with another type of Green functions defined in terms of character sheaves [21]. So we can place ourselves in the setting of [20, Chap. 24]. Thus, the restrictions of the functions to are indeed the characteristic functions of the character sheaves in [20, 24.2]. Furthermore, the functions defined above are indeed equal to the functions in [20, 24.2.3]; thus, if , then we have
[TABLE]
where is the stalk of at and is a certain linear map of finite order. In particular, this shows that the values of are algebraic integers. Then all of the above statements follow from [20, 24.2, 24.3, 24.5] and [20, Theorem 24.4]. Note that the hypotheses of [20, Theorem 24.4] (“cleanness”) are always satisfied by the main result of [24]. (Since we are only dealing with Green functions of , and not with generalised Green functions, it would actually be sufficient to refer to [7, §3] instead of [24]; see also [12, §2] where all of the above are discussed in somewhat more detail.) ∎
Remark 2.4**.**
Lusztig [20, §24.4] describes a purely combinatorial algorithm for computing the coefficients , which modifies and simplifies an earlier algorithm of Shoji [36, §5]. For this purpose, we define three matrices
[TABLE]
where, in each case, the indices run over all . Here, are the coefficients in Theorem 2.3; furthermore,
[TABLE]
Then the orthogonality relations in Proposition 2.2 give rise to the matrix identity
[TABLE]
In general, given the right hand side , such a system of equations will not have a unique solution for . But if we take into account the additional information on the coefficients in Theorem 2.3(c), then it does have a unique solution, which can be found by a recursive algorithm.
Remark 2.5**.**
The Springer correspondence is explicitly known in all cases; see the tables in Carter [3, §13.3], Lusztig [18], Lusztig–Spaltenstein [26], Spaltenstein [41] (and the further references there). It can be obtained electronically, via tables or combinatoral algorithms, through Michel’s version of the CHEVIE system [30]; see the function UnipotentClasses. There is also an implementation of the algorithm in Remark 2.4; see the function ICCTable. Examples will be given below.
Example 2.6**.**
Let be the trivial representation of . Clearly, we have ; furthermore, we can certainly choose to be the identity map. Then, with this choice, we have
[TABLE]
see [5, 7.14.1] or [3, Prop 7.4.2]. It is also known that where is the class of regular unipotent elements (see, e.g., [41, 1.1]); hence, we have
[TABLE]
Combining the above two expressions for , the functions are determined for all such that . Indeed, if , then let us write where is an -stable unipotent class. Since the functions are linearly independent, we conclude that
[TABLE]
Since and for all , we either have for all , or for all , where the sign is determined by .
Example 2.7**.**
Let be of type and . In this case, where is the reflection corresponding to a long simple root and is the reflection corresponding to a short simple root. We have
[TABLE]
where is the trivial representation, is the sign representations, , are two further one-dimensional representations such that
[TABLE]
finally, is the standard reflection representation and is a further two-dimensional representation. The Frobenius map acts trivially on and so . In Michel’s version of CHEVIE [30], we obtain the information on unipotent classes and the Springer correspondence as follows.
gap> W := CoxeterGroup("G",2);; gap> uc := UnipotentClasses(W,3);; # p=3 gap> Display(uc); Display(ICCTable(uc));
The information is summarized in Table 1 (see also [41, p. 329]). There are unipotent classes, denoted by , , , , . Since , we also have for all . Thus, we obtain explicit expressions
[TABLE]
It remains to determine the values of for all . In the present case, this is easily done using Example 2.6. Indeed, since all entries in the last column of Table 1 are equal to , we have . Hence, each function is identically on where .
In general, the determination of the functions is a very subtle problem. In order to solve it, one either needs further geometric information (as, for example, in Beynon–Spaltenstein [1, §3, Case V], Shoji [40, §1]) or some additional information about character values of , which was readily availaible in the above example but may require much more work in other cases (as, for example, in Malle [28]). The following discussion, which is inspired by the approach of Marcelo–Shinoda [29], will turn out to be very useful in later sections.
Remark 2.8**.**
For , the virtual representation of Deligne–Lusztig is known to be an actual representation, which is in fact the permutation representation of on the cosets of (see [5, 1.5] or [3, 7.2.4]). Thus, for any unipotent element , we have
[TABLE]
where are representatives of the conjugacy classes of that are contained in the -conjugacy class of . On the other hand, expressing as a linear combination of ’s and then using Theorem 2.3(b), we obtain that
[TABLE]
Thus, since the terms are determined by the algorithm in Remark 2.4, this yields conditions on the values of the functions , once we manage to obtain some information about by other means.
In Sections 5–8, we will try to evaluate explicitly for certain unipotent elements (see Example 3.6 below for a first illustration). For this purpose, we note that the formula for can be further refined using the Bruhat decomposition. Let be the root system of with respect to . Let be the set of positive roots determined by the choice of . Finally, let be the corresponding set of simple roots, where is a finite indexing set. This defines a length function . For each , let be the corresponding root subgroup. For , we set
[TABLE]
we also fix a representative of in . Here, we tacitly assume that is chosen such that whenever , which is possible by [3, p. 33]. Then we have the following sharp form of the Bruhat decomposition.
[TABLE]
see [3, Theorem 2.5.14 and Prop. 2.5.6]. Writing where , we actually have with uniqueness of expression.
Lemma 2.9**.**
Let be unipotent. Then
[TABLE]
where for all such that .
Proof.
By [3, §2.9], we also have a sharp form of the Bruhat decomposition for the finite group , such that , where the union runs over all such that . Inverting elements, we see that
[TABLE]
is a complete set of representatives of the cosets . This yields the above formula. ∎
Remark 2.10**.**
As far as explicit computations using a computer are concerned, the above formula means that
[TABLE]
where runs over all elements of of any given bounded length. Note that (see [3, p. 74]) which quickly becomes very large with growing . Thus, we can only reasonably work with bounds like (if ) or (if ) on a standard computer. In any case, the above estimate will be crucial in our discussion of groups of exceptional type in Sections 5–9.
3. On the determination of the functions
We will assume from now on that is simple and that the Frobenius map is given by
[TABLE]
where is an automorphism of finite order (leaving invariant) and is a Frobenius map corresponding to a split -rational structure, such that commutes with and for all . Thus, is an untwisted or twisted Chevalley group, as in Steinberg [42]. Note that induces an automorphism of which is just the automorphism induced by considered earlier.
Remark 3.1**.**
It is known that all unipotent classes of are -stable (since, in each case, representatives of the classes are known which lie in ; see, e.g., Liebeck–Seitz [15]). Let be an -stable unipotent class. We shall also make the following assumption.
- ()
There exists an element such that acts trivially on the finite group of components .
If () holds, then there is a bijective correspondence between the conjugacy classes of and the conjugacy classes of that are contained in the set (see, e.g., [15, Lemma 2.12]). For , an element in the corresponding -conjugacy class is given by where is such that maps to under the natural homomorphism . (The existence of is guaranteed by Lang’s Theorem; note that is not unique but is well-defined up to -conjugacy.)
Remark 3.2**.**
Let and , such that and . Now let us fix an element as in (), such that acts trivially on . Then it is known (see Lusztig [23, 19.7]) that there is a natural -module structure on the stalk ; in fact, we have and there is a root of unity such that
[TABLE]
Since the values of are integers, it easily follows that . (See [12, Lemma 3.3] for further details.) Note that is just an entry in the ordinary character table of . In particular, if , then is -conjugate to and so is determined by the identity
[TABLE]
Thus, the whole problem of computing the Green functions is reduced to the determination of the signs for (cf. Shoji [39, 1.3, p. 161]).
Remark 3.3**.**
In the tables in Carter [3, §13.3], Lusztig–Spaltenstein [26] and Spaltenstein [41], the pair corresponding to via the Springer correspondence is specified by indicating the class , the group (where ) and the irreducible -module . For example, in Table 1, we have and so is the trivial representation of , in all cases. For of exceptional type, the possibilities for are rather limited: either is abelian of order at most , or a dihedral group of order , or isomorphic to a symmetric group where , or isomorphic to (see [41, 5.4]).
Remark 3.4**.**
Let be an -stable unipotent class and be such that acts trivially on . Let be representatives of the -conjugacy classes that are contained in , and let be corresponding representatives of the conjugacy classes of (see Remark 3.1).
(a) Let be such that . Then the corresponding -module is the trivial representation and we have
[TABLE]
Now let be the trivial representation. Then the restriction of the almost character to is constant and so (see Example 2.6). Hence, the sign is determined by the Lusztig–Shoji algorithm in Remark 2.4.
(b) Let be such that where is not the trivial local system. Then we have for . Hence, we obtain
[TABLE]
The sum on the right hand can be explicitly computed using the knowledge of the centraliser orders and the character table of the group . On the other hand, the left hand side is also known from the Lusztig–Shoji algorithm in Remark 2.4. Hence, if the left hand side is non-zero, then we also obtain ; since is known from (a), this also determines .
If the left hand side is zero, then some special arguments are required. A very particular such case occurs for of type and , where and it turns out that and ; see Beynon–Spaltenstein [1, §3, Case 5]. (We will encounter a similar case in Section 9.)
Example 3.5**.**
Let be an -stable unipotent class such that for . Note that acts trivially on for any (since has order ). So let us fix some . Assume that is such that . Then the corresponding sign is determined as in Remark 3.4(a). Let us also assume that there exists such that where is a non-trivial local system. Now splits into two classes in ; let be such that are not conjugate in . Then the values of , are given by
[TABLE]
(Note that corresponds to the trivial character of and corresponds to the non-trivial character of .) Now, we either have or . But, as already discussed in [1, p. 591], if we are in the second case, then we change the roles of and, with the new choice of , we will have . Thus, in the present situation, we can always choose such that , and is unique up to conjugation within . The only remaining problem is to identify in a given list of representatives of unipotent classes. In order to try to solve this problem, we follow Remark 3.4(b) and consider the relation
[TABLE]
This leads to the following two cases.
(a) If , then () implies , which distinguishes the representatives .
(b) If , then an additional argument is required in order to distinguish the representatives . (See §5.2 below for a typical example.)
Example 3.6**.**
Let be of type and . Then acts trivially on and the induced automorphism is the identity. Consequently, . By [15, Table 22.2.6], there are unipotent classes of , which are all -stable. Let be the unipotent class denoted by ; we have for . The set splits into three classes in , with centraliser orders . Thus, up to conjugation by elements in , there is a unique such that and acts trivially on . This whole discussion also works for the Frobenius map . Thus, we can even assume that and acts trivially on . If is a unipotent class different from , then for . Consequently, condition () holds for all unipotent classes of . The Springer correspondence is explicitly described by Spaltenstein [41, p. 329]; see Table 2. As in Example 2.7, we run the function ICCTable which yields the coefficients . By inspection of Table 2, we see that there is just one case which is not covered by the arguments in Remark 3.4. The relevant unipotent class is the above-mentioned class ; we have
[TABLE]
Using the output of ICCTable and the argument in Remark 3.4(a), we already see that . However, we have and so we can not apply the method in Remark 3.4(b). We now argue as follows. Using the output of ICCTable (see Table 2), we compute the coefficients in Remark 2.8. We obtain the following formula:
[TABLE]
Thus, depending on whether equals or , we have or . On the other hand, by Remark 2.8, also is the value at of the character of the permutation representation of on the cosets of . We use this interpretation to show that . For this purpose, it will be sufficient to show that . Assume, if possible, that . Then we also have . We have a natural homomorphism , with kernel consisting of unipotent elements only. If , then and so would be a unipotent group, contradiction to the fact that is a quotient of . If (and ), then will still be a quotient of the image of in , contradiction since is abelian. Thus, we do have and so , as claimed. But this forces .
Remark 3.7**.**
Assume that and where . Let us first consider the case where and is an untwisted Chevalley group over the prime field . The whole discussion above applies, of course, with instead of . In order to have a separate notation from the general case, we introduce a superscript “” to various objects considered earlier. Thus, for , we denote by the virtual representation of defined by Deligne–Lusztig, and by the corresponding Green function. For , let be the corresponding almost character. (Note that, now, acts trivially on and so .) As in Remark 3.1, we assume that there exists an element such that acts trivially on . By Remark 3.2, there is a well-defined sign, which we now denote by , such that
[TABLE]
Having fixed the above notation, we now consider for any . Then we still have , and acts trivially on . Let be as in Remark 3.2, now with respect to . Then, by [12, Theorem 3.7], we have
[TABLE]
Thus, in order to determine , it is sufficient to consider the case where . This will be our main tool in the discussion of groups of exceptional type, in order to deal with those cases which are not covered by Remark 3.4.
4. Explicit realisations of
Assume that is a simple algebraic group. In order to perform explicit computations on a computer with elements of (as in the following sections), we need a concrete realisation of as a matrix group. Now, in principle it is well-known how to do this, using Chevalley’s construction as explained in detail by Carter [2] and Steinberg [42]. Computer programs are available as described by Cohen–Murray–Taylor [4], for example. Note that the starting point of this approach is the choice of a Chevalley basis in the corresponding simple Lie algebra over . For example, Mizuno [32, Table 12] explicitly specifies such a choice for type . But this raises the following issue. If we want to perform computations with Mizuno’s class representatives using the Cohen–Murray–Taylor programs, we would first need to clarify the relation between the chosen Chevalley bases — and the same issue arises with any other reference to the literature about explicit computations in .
Here, we wish to advertise two recent developments with regard to these issues. Firstly, Lusztig [25] gives an explicit, canonical construction of as a matrix group, which does not depend at all on the choice of a Chevalley basis. Since this only yields root elements in for simple roots and their negatives, one still needs to specify a Chevalley basis for further computations. But then, secondly, [8] produces two canonical choices of a Chevalley basis, which differ from each other by a global sign and, thus, yield “canonical” root elements for all roots. The computer algebra package ChevLie [10] implements these constructions and works both in GAP4 [6] and Michel’s version of GAP3 [30]. We briefly explain the constructions of [8], [25] and the basic functionality of the ChevLie package.
4.1. Cartan matrices and the -function
Let be a finite index set and be the Cartan matrix of an irreducible (crystallographic) root system. In Table 3, we fix a labelling of the corresponding Dynkin diagram. Recall that can be recovered from the diagram as follows. For , we have . Now asssume that are such that . Then if are not joined by an edge. We have if are joined by a simple edge. Furthermore, and if are joined by a double edge with an arrow pointing towards . Finally, and if are joined by a triple edge with an arrow pointing towards . For example:
[TABLE]
In Table 3, we also specify a function such that whenever and . Note that, since the diagram is connected, there are exactly two such functions: if is one of them, then the other one is .
4.2. The Weyl group and the root system
Let be a -vector space with a basis . For , we define a linear map by for . Then and so . Then the corresponding Weyl group is given by , with root system
[TABLE]
where is a system of simple roots. In CHEVIE [13], all of the above is realised by the function CoxeterGroup, which returns a record containing basic data corresponding to a given Dynkin diagram. For ChevLie, we essentially copied the code of that function, so that it works both in GAP3 and GAP4. Example:
gap> W := WeylRecord("B",2);;
gap> W.cartan # the Cartan matrix
[ [ 2, -2 ], [ -1, 2 ] ]
gap> W.roots; # I-tuples representing the roots
[ [ 1, 0 ], [ 0, 1 ], [ 1, 1 ], [ 2, 1 ],
[ -1, 0 ], [ 0, -1 ], [ -1, -1 ], [ -2, -1 ] ]
gap> W.epsilon;
[ 1, -1 ]
The record component epsilon holds the function . (This is not present in the original CHEVIE system.)
4.3. The operators and
For any such that , we define
[TABLE]
Thus, is the -string through . Following Lusztig [25, §2], we now consider a -vector space with a basis and define linear maps and by the following formulae, where and .
[TABLE]
Note that all entries of the matrices of , with respect to the given basis of are non-negative integers. We consider as a Lie algebra with the usual Lie bracket for . We set for . As in [8, §4], consider the Lie subalgebra generated by (). Then is a (split) simple Lie algebra with Cartan subalgebra and corresponding root system . In particular, we have the Cartan decomposition
[TABLE]
In ChevLie, we obtain matrices representing through the following command.
gap> W := WeylRecord("E",7);
gap> r := LieAdjRepresentation(W);;
gap> #I dim = 133, Chevalley relations ....... true
If the basis vectors are ordered as in [8, Lemma 4.1], then each is a nilpotent upper triangular matrix and each is a nilpotent lower triangular matrix. This convention is used in ChevLie. There is also the function LieMinusculeRepresentation which constructs the matrices in a representation with a minuscule heighest weight, as in [9].
gap> W := WeylRecord("E",7);
gap> m := MinusculeWeights(W);
[ [ 0, 0, 0, 0, 0, 0, 1 ] ]
gap> r := LieMinusculeRepresentation(W,m[1]);;
#I dim = 56, Chevalley relations true
4.4. Lusztig’s construction of Chevalley groups
Following Lusztig [25, §2], we now obtain a Chevalley group over any field as follows. Since the and are nilpotent, we can define and for all and . Explicitly, we have:
[TABLE]
where and , . (Compare with the formulae in [2, §4.3].) Now let be any field and be a -vector space with a basis . For and , we define and by formulae as above (which involve only integer coefficients; see also [2, §4.4].) Then
[TABLE]
is a Chevalley group over .
4.5. The -canonical Chevalley basis
For each , let us choose a non-zero element . If are such that , then we define by . Now is called a Chevalley basis if
[TABLE]
Clearly, if is a Chevalley basis, then so is , for any choice of the signs. Now, having fixed , there is a unique Chevalley basis such that the following relations hold, for any :
[TABLE]
(See [8, Theorem 5.7 and Example 5.9].) If we replace by , then for all . In ChevLie, the complete list of elements , as matrices with respect to the basis of , is obtained through the command CanonicalChevalleyBasis(W).
4.6. Root elements
Let . By [8, Cor. 5.6], the linear map is nilpotent and so we can define for any . As in §4.4, if is any field, then we obtain analogous elements for . If is replaced by , then for all . Thus, having fixed , we obtain “canonical” root elements . In ChevLie, these are obtained as follows.
gap> W := WeylRecord("E",8);
gap> rep := LieAdjointRepresentation(W);
gap> cb := CanonicalChevalleyBasisRep(W,rep);
gap> r := W.roots[70];
[ 1, 1, 2, 3, 2, 1, 1, 0 ]
gap> u := ChevalleyRootElement(W,cb,r,5); # t=5
< matrix 248x248 over the integers >
(One can equally well use elements from finite fields, of course; furthermore, instead of the adjoint representation, one can also use a representation with a minuscule highest weight, if such a representation exists.) Once the elements are available, we can also define elements and by analogous formulae as in [2, Lemma 6.4.4]. These elements yield the familiar diagonal elements and lifts of reflections in the Weyl group, respectively.
In ChevLie, the basis of is ordered such that all , , are represented by unipotent upper triangular matrices, and all , , by unipotent lower triangular matrices; futhermore, all are diagonal and all are monomial matrices. Thus, the unipotent radical of the standard Borel subgroup of , that is, the subgroup
[TABLE]
consists precisely of the unipotent upper triangular matrices in .
4.7. Computing estimates for
Now let , where as in the previous sections, and is given by for and . Once the above functions are available, it is straightforward to write a program which computes the cardinalities of the sets in Lemma 2.9, where . For , let where . Then
[TABLE]
with uniqueness of expression. Thus, by running systematically over all tuples , we have a way of running through the elements of , one by one. For each , we need to check if which, by the remarks in §4.6, is simply done by testing if is an upper triangular matrix. (Some modifications are needed for twisted groups; see §7.1 below.)
This description shows that computer memory is not an issue, but speed is critical. We shall have to perform several millions of multiplications of matrices (of moderate size) over small finite fields. For this purpose, the GAP [6] function ImmutableMatrix turns out to be particularly efficient. It converts a given matrix into an internal format which appears to be highly optimized concerning space and runtime.
5. On the Green functions of type in characteristic
Throughout this section, let be a simple algebraic group of type . We have where is the root system of with respect to . Let be the set of simple roots with respect to , where the labelling is as in Table 3. We assume that is defined and split over , with corresponding Frobenius map such that for all . Let where . Then
[TABLE]
For , the Green functions of have been determined by Shoji [35]. For , the Green functions are explicitly computed by Malle [28]. It is briefly remarked by Marcelo–Shinoda [29] that Shoji’s computations remain valid for . Since further details are omitted in [29], we provide here an independent verification based on the results in Section 3; this will also serve as a model for the later case studies in Sections 6–9. In the following, if , we just write instead of .
5.1. Critical unipotent classes for
Assume from now on that . We have and the character table of is available in CHEVIE. Now acts trivially on and is the identity. Consequently, . By Shoji [34], there are unipotent classes of , which are all -stable. Furthermore, for each unipotent class , there exists an element such that and acts trivially on ; see [34, Table 6]. Thus, condition () in Section 3 holds. The Springer correspondence is explicitly described by Spaltenstein [41, p. 330]. As in Example 2.7, we run the function ICCTable which yields the coefficients . By inspection of the output, we see that for all , where is the trivial representation of . Hence, by the argument in Remark 3.4(a), we already have that
[TABLE]
There are further cases which are not covered by the arguments in Remark 3.4(b); these are specified in Table 4. The last two columns specify such that and with .
In the table, we use the notation of Spaltenstein [41] for . The translation to the notation of Carter [3, §13.2] (or CHEVIE) is as follows.
[TABLE]
5.2. The class
Let be the unipotent class denoted by . Since for , we are in the situation of Example 3.5, with and ; see Table 4. We already know that there exists some such that acts trivially on and . The only remaining problem is to identify in a given list of class representatives. For a certain choice of a Chevalley basis in the Lie algebra of , a representative is explicitly described by Lawther [14, Table A]. Since our “canonical” Chevalley basis in Section 4 may be different from that in [14], we can only say that
[TABLE]
where for . Clearly, we have . Using our computer programs in §4, we check explicitly that all elements as above, for all possible choices of the , are conjugate under elements of . Hence, we may assume without loss of generality that for all . Now consider the signs and with respect to . Since , we already know that . We claim that we also have . Since , we can apply Remark 3.7. Thus, it will be sufficient to determine in the special case where . We now argue as in Example 3.6. Using the output of ICCTable, we find the coefficients in §2.8. This yields the formula
[TABLE]
Setting , we obtain . On the other hand, by Remark 2.10, we can try to directly compute the value of (or, at least, a lower bound for that value), by running through the sets and checking if the corresponding coset representatives are fixed by . It turns out that we just need to go up to in order to find cosets that are fixed. (Since we already know that , it would actually be enough to find strictly more than cosets that are fixed — this simple remark will be important in later sections when the values of get significantly larger.) Thus, we do have and, indeed, is a representative such that (regardless of the choice of a Chevalley basis).
5.3. The class
Let be the unipotent class denoted by . Again, we are in the situation of Example 3.5, now with and ; see Table 4. As in the previous case, there exists some such that . The only remaining problem is to identify in a given list of class representatives. By Lawther [14, Table A], there is a choice of signs such that
[TABLE]
We check again that all elements as above, for all possible choices of the signs, are conjugate under elements of . Hence, as in the previous case, we may assume without loss of generality that for all . We consider the signs and with respect to . Since , we already know that . Since , it will again be sufficient to determine in the special case where . Using the output of ICCTable, we find the formula
[TABLE]
Setting , we obtain . Again, by an explicit computation counting coset representatives, we find that . (We just need to look at sets where .) Thus, indeed, is a representative such that (regardless of the choice of a Chevalley basis).
5.4. The class
Let be the unipotent class denoted by . We have for . By Shoji [34, Table 6], the set splits into five classes in , with centraliser orders . Thus, up to conjugation by elements in , there is a unique such that and acts trivially on . Now, via the Springer correspondence, there are four irreducible representations of associated with . These are , , , ; see Table 4. We already know that . Now can be chosen to be fixed by ; see the explicit expression in [34, Table 6]. So, by Remark 3.7, it is sufficient to determine , , in the special case where .
Let be representatives of the -conjugacy classes that are contained in , and let be corresponding representatives of the conjugacy classes of (see Remark 3.1). Using the output of ICCTable, and setting , we find the formula
[TABLE]
for . Now, up to the signs , , , the values of the -functions on are given by character values of ; see Remark 3.2. Thus, up to those signs, we can explicitly determine the values . We find that for all , regardless of what the signs , , are; furthermore,
[TABLE]
Hence, if we can find an element such that , then must be conjugate to in and . Now, using the list of representatives in [34, Table 6] and adjusting some signs, we consider the element
[TABLE]
where we work with the “canonical” Chevalley basis as in Section 4. We check that, in the adjoint representation, has Jordan blocks of sizes . Hence, we have ; see [14, Table 4]. By an explicit computation counting coset representatives, we find that . (We just need to look at sets where .) Thus, indeed, are conjugate in and we do have .
5.5. The class
Let be the unipotent class denoted by . Again, we are in the situation of Example 3.5, now with and ; see Table 4. As in the first case, there exists some such that . The only remaining problem is to identify in a given list of class representatives. By Lawther [14, Table A], there is a choice of signs such that
[TABLE]
Now we find that all elements as above, for all possible choices of the signs, are conjugate under elements of to one of the following two elements:
[TABLE]
We check that, in the adjoint representation, both and have Jordan blocks of sizes . Hence, we have ; see [14, Table 4]. We consider the signs and with respect to . Since , we already know that . Since , it will again be sufficient to determine in the special case where . Using the output of ICCTable, we find the formula
[TABLE]
Setting , we obtain . By an explicit computation counting coset representatives, we find that . (For , we just need to look at sets where in order to find cosets that are fixed; for we have to go up to in order to find strictly more than cosets that are fixed.) In particular, this shows that are conjugate in . Hence, indeed, is a representative such that (independently of the choice of a Chevalley basis).
Remark 5.6**.**
By analogous arguments, we obtain an independent verification of the results of Malle [28] on the Green functions of .
6. On the Green functions of untwisted in
characteristic
Throughout this section, let be a simple algebraic group of (adjoint) type . We have where is the root system of with respect to . Let be the set of simple roots with respect to , where the labelling is chosen as in Table 3. We assume that is defined and split over , with corresponding Frobenius map such that for all . Let where . Then
[TABLE]
For , the Green functions have been determined by Beynon–Spaltenstein [1]. For , the Green functions are explicitly computed by Malle [28] and Porsch [33]. Since the results for have never been published, and since we also need them when dealing with the twisted case, we will provide here an independent verification of Porsch’s results.
6.1. Critical unipotent classes for
Assume from now on that . We have and the character table of is available in CHEVIE. Now acts trivially on and is the identity. Consequently, . By Mizuno [31], there are unipotent classes of , which are all -stable. Furthermore, for each unipotent class , there exists an element such that and acts trivially on ; see [31, Prop. 6.1]. Thus, condition () in Section 3 holds. The Springer correspondence is explicitly described by Spaltenstein [41, p. 331]. As in Example 2.7, we run the function ICCTable which yields the coefficients . By inspection of the output, we see that there is just one case which is not covered by the arguments in Remark 3.4; see Table 5 where the last two columns specify such that and with .
In the table, we use the notation of Spaltenstein [41] for , which is just a slight variation of Carter [3, §13.2] (or CHEVIE); for example, the representation is denoted by in [3, p. 415].
6.2. The class
Let be the unipotent class denoted by . (Note that Mizuno uses the notation for this class.) Since for , we are in the situation of Example 3.5, with and . The following argument is analogous to that in §5.2. We already know that there exists some such that acts trivially on and . Using the output of ICCTable and the argument in Remark 3.4(a), we have and, hence, also . The only remaining problem is to identify in a given list of class representatives. By Mizuno [31, Lemma 4.3], there is a choice of signs such that
[TABLE]
But then we check again that all elements as above, for all possible choices of the signs, are conjugate under elements of . Thus, we may assume that all signs are . Then we consider the signs and with respect to . Since , we already know that . Since , we can apply Remark 3.7. Thus, it will be sufficient to determine in the special case where . Using the output of ICCTable, we find the coefficients in §2.8. This yields the formula
[TABLE]
Setting , we obtain . By an explicit computation counting coset representatives, we find that . (In the setting of Lemma 2.9, we just need to look at sets where .) Thus, indeed, is a representative with respect to which we have (regardless of the choice of a Chevalley basis).
6.3. A different representative for
Let be as above, but now consider the element
[TABLE]
(This will be useful in the following section, when we consider twisted groups of type .) We claim that , are conjugate in . First we check that, in the adjoint representation, has Jordan blocks of sizes . Hence, we have ; see [14, Table 6]. Furthermore, we check that all the elements
[TABLE]
are conjugate under elements of . As above, we set and compute that . Thus, must be conjugate in to (regardless of the choice of a Chevalley basis). Furthermore, if we take as the chosen representative in , then the correponding signs and will again be equal to .
6.4. Improving efficiency
We have and there are elements such that . So, a priori, in §6.2 we would have to look at
[TABLE]
coset representatives in order to obtain that . Since we only need to establish the estimate , we can try to reduce the number of elements to consider, as follows.
Let for some . Writing as a product of terms where and , and using Chevalley’s commutator relations, we see that
[TABLE]
Now will only contribute to if . So we just consider those such that and the roots , , , , are all positive. There are such elements , accounting for only cosets. It turns out that, already among these cosets, we find more than ones that are fixed by . (And a similar procedure works in all the other cases that we consider in Section 8, where and such a reduction becomes even more important.)
Remark 6.5**.**
By analogous arguments, we obtain an independent verification of the results of Malle [28] on the Green functions of .
7. On the Green functions of twisted in
characteristic
Throughout this section, let again be a simple algebraic group of (adjoint) type . We have where is the root system of with respect to . Let be the set of simple roots with respect to , where the labelling is chosen as in Table 3. We assume that is defined and split over , with corresponding Frobenius map such that for all . Now we also consider the non-trivial graph automorphism of order , such that and . This induces the following permutation of the simple roots:
[TABLE]
Let and . Then where .
For , the Green functions have been determined by Beynon–Spaltenstein [1]. For , the Green functions are explicitly computed by Malle [28]. To complete the picture, it remains to deal with the case .
7.1. Root elements in
Let be the Lie algebra of type , realized as a subalgebra of as in Section 4; recall that comes equipped with a basis . Let , , be the permutation induced by the automorphism . Then define a linear map by
[TABLE]
for all ; note that . Then one simply checks that conjugation with inside defines the non-trivial graph automorphism of . We shall assume throughout this section that is realised as in §4.4. Then is also realised by conjugation with inside . Furthermore, consider the “canonical” Chevalley basis of . Then one also checks that for all . In this situation, root elements for have a simple description as in [2, Prop. 13.6.3], that is, given and , we have
[TABLE]
(Note that, in type , we have for all ; so we only have to consider cases (i) and (ii) of [2, Prop. 13.6.3].) It is then straightforward to adjust the program in §4.7 to the present situation.
7.2. Critical unipotent classes for
Assume from now on that . The induced automorphism is given by conjugation with the longest element . Consequently, . For each , we need to choose a map as in §2.1. In CHEVIE, the “preferred” choice for specified by Lusztig [19, 17.2] is taken. By [15, Lemma 20.16], all the unipotent classes of are stable under and under . Further information about the classes is provided in [15, Table 22.2.3]. This shows that, for each unipotent class , there exists some such that acts trivially on . Thus, condition () in Section 3 holds. As in Example 2.7, we run the function ICCTable which yields the coefficients :
gap> W := RootDatum("2E6");; gap> Display(CharTable(W)); gap> uc := UnipotentClasses(W,3);; # p=3 gap> Display(uc); Display(ICCTable(uc));
By inspection of the output, we see that there is only one case which is not covered by the arguments in Remark 3.4, exactly as in Section 6, Table 5.
7.3. The class (twisted case)
Let be the unipotent class denoted by . Since for , we are in the situation of Example 3.5, with and . The following argument is analogous to that in §6.2, but some additional care is needed because of the presence of the graph automorphism . We already know that there exists some such that acts trivially on and . Using the output of ICCTable and the argument in Remark 3.4(a), we have and, hence, also . Again, the only remaining problem is to identify in a given list of class representatives. We claim that, regardless of the choice of a Chevalley basis in the Lie algebra of , we can take to be the element already considered in §6.3:
[TABLE]
By §7.1, we have ; in fact, is fixed by both and . Conjugating by elements in , one sees again that the -conjugacy class of is well-defined, regardless of the choice of a Chevalley basis. We consider the signs and with respect to . Since , we already know that . So it remains to show that . Since is fixed by and by , we can apply the argument in [12, Remark 3.8]. This shows that
[TABLE]
where is the sign from the untwisted case in Section 6. By §6.3, we have for all . Hence, we conclude that does not depend on either. So it will be sufficient to determine in the special case where . Using the output of ICCTable, we find the coefficients in §2.8. This yields the formula
[TABLE]
Setting , we obtain . By an explicit computation counting coset representatives, we find . (In the setting of Lemma 2.9, we just need to look at sets where .) Thus, indeed, is a representative with respect to which we have .
Remark 7.3**.**
By analogous arguments, we obtain an independent verification of the results of Malle [28] on the Green functions of .
8. On the Green functions of type in characteristics
Throughout this section, let be a simple algebraic group of (adjoint) type . We have where is the root system of with respect to . Let be the set of simple roots with respect to , where the labelling is chosen as in Table 3. We assume that is defined and split over , with corresponding Frobenius map such that for all . Let where . Then
[TABLE]
For , the Green functions have been determined by Beynon–Spaltenstein [1]. To complete the picture, it remains to deal with the cases . In the following, if , we just write instead of .
8.1. Critical unipotent classes for
Assume from now on that or . We have and the character table of is available in CHEVIE. Now acts trivially on and is the identity. Consequently, . The unipotent classes of have been classified by Mizuno [32]. Each unipotent class is -stable and there exists an element such that and acts trivially on ; see [32, Table 2]. Thus, condition () in Section 3 holds. The Springer correspondence is explicitly described by Spaltenstein [41, p. 331–333]. As in Example 2.7, we run the function ICCTable which yields the coefficients . By inspection of the output, we see that for all , where is the trivial representation of . Hence, by Remark 3.4(a), we already have that
[TABLE]
There are further cases which are not covered by the arguments in Remark 3.4(b); these are specified in Table 6 where, as before, the last two columns specify such that and with .
In the table, we use the notation of Spaltenstein [41] for , which is just a slight variation of Carter [3, §13.2] (or CHEVIE); for example, the representation is denoted by in [3, p. 416].
8.2. The class for
Let be the unipotent class denoted by . (Note that Mizuno uses the notation for this class.) Since for , we are in the situation of Example 3.5, with and . The following argument is analogous to that in §5.5. We already know that there exists some such that acts trivially on and . The only remaining problem is to identify in a given list of class representatives. Using Mizuno [31, Table 2], checking sizes of Jordan blocks, and arguing as in §5.5, we may take
[TABLE]
regardless of the sign or the choice of a Chevalley basis. We consider the signs and with respect to . Since , we already know that . Since , we can apply Remark 3.7. Thus, it will be sufficient to determine in the special case where . Using the output of ICCTable, and setting or , we obtain the formulae
[TABLE]
(Of course, in general, the polyonomial expressions for the values of will depend on whether or , but for the classes in Table 6, they do coincide.) By an explicit computation counting coset representatives (see Lemma 2.9), we find that equals if , and if . (If , then we just need to look at sets where in order to find cosets that are fixed; if , then we just need to go up to in order to find strictly more than cosets that are fixed.) In particular, , are conjugate in . Thus, indeed, is a representative with respect to which we have (regardless of the choice of a Chevalley basis).
8.3. The class for
Let and be the unipotent class denoted by . (Note that Mizuno uses the notation for this class.) Since for , we are in the situation of Example 3.5, with and . The following argument is analogous to that in §5.5. We already know that there exists some such that acts trivially on and . The only remaining problem is to identify in a given list of class representatives. Using Mizuno [31, Table 2], checking sizes of Jordan blocks, and arguing as in §5.5, we may take
[TABLE]
regardless of the sign or the choice of a Chevalley basis. We consider the signs and with respect to . We already know that . Since , we can apply Remark 3.7. Thus, it will be sufficient to determine in the special case where . Using the output of ICCTable, we find the following formula.
[TABLE]
Setting , we obtain that . By an explicit computation counting coset representatives, we find that . (We just need to look at sets where in order to find strictly more than cosets that are fixed by .) Thus, and are conjugate in and, indeed, is a representative with respect to which we have (regardless of the choice of a Chevalley basis).
8.4. The class for
Let be the unipotent class denoted by . (Note that Mizuno uses the notation for this class.) We have for . The set splits into three classes in , with centraliser orders . Thus, up to conjugation by elements in , there is a unique such that and acts trivially on . Now, via the Springer correspondence, there are three irreducible representations of associated with . These are , , ; see Table 6. We already know that . Now can be chosen to be fixed by ; see the explicit expression in [32, Table 2]. So, by Remark 3.7, it is sufficient to determine , in the special case where . The following argument is analogous to that in §5.4.
Let be representatives of the -conjugacy classes that are contained in , and let be corresponding representatives of the conjugacy classes of , where the notation is such that corresponds to a transposition in and to a -cycle. Using the output of ICCTable, and setting or , we find the formula
[TABLE]
for . Now, up to the signs and , the values of the -functions on are given by character values of ; see Remark 3.2. Thus, we obtain
[TABLE]
Since , this already forces that in both cases. We claim that we also have . For this purpose, we consider the values at :
[TABLE]
By Mizuno [32, Lemma 21], there is a choice of signs such that
[TABLE]
and . Then will be conjugate to in .
If , then for all , and the above formula shows that . By an explicit computation counting coset representatives (see Lemma 2.9), we find that . (We just need to look at sets where .) Hence, , as claimed.
Now assume that . Then . Now we simply consider all elements as above, for all posssible choices of the signs . For each such choice, has Jordan blocks of sizes and, hence, ; see [14, Table 8]. Furthermore, we find that in each case. (We just need to look at sets where .) Hence, , as claimed.
8.5. The class for
Let be the unipotent class denoted by . (Note that Mizuno uses the notation for this class.) Since for , we are in the situation of Example 3.5, with and . The following argument is analogous to that in §5.2. We already know that there exists some such that acts trivially on and . The only remaining problem is to identify in a given list of class representatives. Using Mizuno [31, Table 2], checking sizes of Jordan blocks, and arguing as in §5.2, we may take
[TABLE]
regardless of the choice of a Chevalley basis. We consider the signs and with respect to . We already know that . Since , we can apply Remark 3.7. Thus, it will be sufficient to determine in the special case where . Using the output of ICCTable, we find the following formula.
[TABLE]
On the other hand, using Lemma 2.9, we can try to directly compute .
If , then we just need to look at sets where in order to find strictly more than cosets that are fixed. A comparison with the above formula shows that we must have . If , then we need to go up to in order to find strictly more than cosets that are fixed. (This is the hardest case for type ; the computation requires less than GB of main memory but takes about a week on a standard computer, even with efficiency improvements as in §6.4.) So we also have in this case.
9. On the Green functions of type in characteristics
In this final section, let be a simple algebraic group of type and be a split Froebnius map as before. Let where . Then
[TABLE]
For , the Green functions have been determined by Beynon–Spaltenstein [1]. Here, we will not be able to complete the computation of the Green functions for the cases where . But we can at least show that the very particular case mentioned in Remark 3.4 also occurs for . So assume from now on that .
We have and the character table of is available in CHEVIE. Now acts trivially on and is the identity. Consequently, . The unipotent classes of have been classified by Mizuno [32]. The Springer correspondence is explicitly described by Spaltenstein [41, p. 333–336]. The “very particular” case is related to the unipotent class specified as follows.
[TABLE]
where, as before, the last two columns specify such that and with . (Note that Mizuno uses the notation for this class; furthermore, the same conventions for the notation of apply as in Section 8.) Up to conjugation by elements in , there is a unique such that and acts trivially on . By Mizuno [32, Lemma 53], such a representative is given by
[TABLE]
(As before, if , we just write instead of .) We consider the corresponding signs with respect to ; we claim that
[TABLE]
This is seen as follows. As before, since , it is sufficient to determine the signs in the special case where (see Remark 3.7). As in Example 2.7, we run the function ICCTable which yields the coefficients . By inspection of the output, and using the argument in Remak 3.4(a), we already see that .
We now follow the argument in §8.4. Let be representatives of the -conjugacy classes that are contained in , and let be corresponding representatives of the conjugacy classes of , where the notation is such that corresponds to a transposition in and to a -cycle. By Mizuno [32, Lemma 53], such representatives are given by
[TABLE]
Using the output of ICCTable, and setting , we find the formula
[TABLE]
for . Up to the signs and , the values of the -functions on are given by character values of ; see Remark 3.2. Thus, for , we obtain
[TABLE]
Assume, if possible, that . Then we would have for . On the other hand, running through all sets (as in Lemma 2.9) where , we already find cosets that are fixed by . Running also through sets where , we find further cosets that are fixed. Thus, we have and so we conclude that , as claimed.
The total running time for these computations is about year, even with efficiency improvements as in §6.4. (It already takes months just to deal with those sets where .) Everything is much slower than in the previous cases because, for type , we only have at our disposal the -dimensional adjoint representation, whereas for type we could use the -dimensional minuscule weight representation. However, distributing the task over a small number of (independent) standard desktop computers with altogether processors, we could manage to complete the computations in weeks. — Once is determined, we obtain (for ). If we could find strictly more than cosets that are fixed by , then we would be able to conclude that . However, this appears to be even more difficult computationally, the reason being that the difference between the lower and the upper bound for the value of is much smaller than in the previous case. (So we would need to find almost all cosets that are fixed by .)
All this clearly indicates that type is not completely out of reach, but some more sophisticated algorithms are certainly required in order to deal with the remaining open cases (especially for ). An independent verification of the above results would also be highly desirable.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] W. M. Beynon and N. Spaltenstein, Green functions of finite Chevalley groups of type E n subscript 𝐸 𝑛 E_{n} ( n = 6 , 7 , 8 𝑛 6 7 8 n=6,7,8 ) , J. Algebra 88 (1984), 584–614.
- 2[2] R. W. Carter, Simple groups of Lie type , Wiley, New York, 1972; reprinted 1989 as Wiley Classics Library Edition.
- 3[3] R. W. Carter, Finite groups of Lie type: Conjugacy classes and complex characters , Wiley, New York, 1985.
- 4[4] A. M. Cohen, S. H. Murray and D. E. Taylor, Computing in groups of Lie type , Math. Comp. 73 (2004), 1477–1498.
- 5[5] P. Deligne and G. Lusztig, Representations of reductive groups over finite fields , Annals Math. 103 (1976), 103–161.
- 6[6] The GAP Group, GAP – Groups, Algorithms, and Programming, Version 4.10.0 , 2018, (https://www.gap-system.org) .
- 7[7] M. Geck, On the average values of the irreducible characters of finite groups of Lie type on geometric unipotent classes , Doc. Math. J. DMV 1 (1996), 293–317 (electronic).
- 8[8] M. Geck, On the construction of semisimple Lie algebras and Chevalley groups , Proc. Amer. Math. Soc. 145 (2017), 3233–3247.
