Computation of Irreducible Characters of GL(5,q)
Shiv Gupta

TL;DR
This paper computes the irreducible characters of the five-dimensional general linear group over a finite field, extending the understanding of its representation theory using Green's techniques.
Contribution
It provides the explicit determination of all irreducible characters of GL(5,q), a significant advancement in the representation theory of finite groups.
Findings
Complete set of irreducible characters for GL(5,q) determined
Methodology based on Green's techniques applied to higher dimensions
Enhances understanding of the structure of linear groups over finite fields
Abstract
In this paper we determine the ordinary irreducible characters of the five-dimensional full linear group over a Galois field of q elements. We use the techniques developed by J. A. Green.
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 · Advanced Algebra and Geometry · Coding theory and cryptography
Computation of Irreducible Characters of
By Shiv K. Gupta
1 INTRODUCTION
111Mathematics Subject Classification. Primary 20C15; Secondary 20C30
In this paper we determine the ordinary irreducible characters of the 5-dimensional full linear group over a Galois field of elements. We use the techniques developed by Green [1].
The characters of have been known for long time. Those of and have been determined by Steinberg [11]. Steinberg has also developed some techniques to find some of the characters in the general case.
There are 42 “types” of characters of . Each of these types contains a number of characters which is a function of . The total number of characters of is . There is a perfect symmetry in the description of conjugate classes and characters.
Thee 42 “types” of characters may in turn be grouped into 17 classes, such that the characters belonging to the same class involve the same basic constituents–the basic characters. For example, the characters of the first seven types to (each containing characters) form one class. Each of these types involve the same basic constituents–the basic characters of type , occurring with distinct coefficients. [These coefficients being the linear combinations which involve what are known as Green Polynomials, with (dual) functions which involve the characters of the symmetric groups.]
2 Definitions and Notation
We have used the standard notation throughout. will denote a finite field of elements; the group of non-singular matrices over GF(), the symmetric group on letters. If is a partition of then we shall write . Conjugate class “types” of have been denoted by the letters and the characters types by .
Let be a partition of n. Then the partition is said to be conjugate to the partition if = number of parts of which are . A conjugate class of is said to be primary if its characteristic polynomial is a power of irreducible (over ) polynomial. We shall number the seven partitions for as follows:
[TABLE]
will denote the primitive elements of GF() such that
[TABLE]
are the primitive (-1)- roots of unity such that
[TABLE]
Let be an irreducible polynomial of degree over GF(). Let be a generating element of GF(). Then a root of has the form where is uniquely determined modulo , and the set consists of all the roots of since are distinct residue mod . Following Green [1] we shall call the set an - with as its roots and its degree. will denote the value of the irreducible character of corresponding to the partition of , on the class corresponding to the partition . will mean that the summation is taken over all the permutations of .
Let denote the set of all simplexes of degrees , and be the set of all partitions of numbers . Then a function such that
[TABLE]
specifies what we shall call a dual class and will designate it by the symbol . To each symbol of a dual class there will correspond a character which we shall denote by the same symbol.
3 Description of Conjugate Classes
Let be a polynomial over . Following Green [1] we define
[TABLE]
and
[TABLE]
where is an identity matrix and there are blocks of .
Let , be a partition of . We define
[TABLE]
Then is a matrix with characteristic polynomial . Let GL() have characteristic polynomial where are distinct irreducibles polynomials over GF(). Then , where deg() is the degree of the polynomial . The matrix is conjugate to a matrix diag{}, where are certain partitions of respectively.
Conversely, let denote the set of all irreducible polynomials over GF() of degree . A conjugate class of GL() can be specified by a partition valued function such that . We designate this class by the symbol .
In the case of we are thus able to describe the conjugate classes systematically. There are conjugate classes in . These are divided into 42 “types” and all these types do appear if . Each type consists of a number of conjugate classes and this number is a function of . All the classes of a particular type have similar minimal polynomial. In and there are respectively 17, 32, 39 and 41 types of classes. We give a list of the canonical forms of the various types of conjugate classes in table 1. The table 2 gives the number of classes in each type and also the number of elements in each class.
4 Uniform Functions and Basic Uniform Functions
Let denote a square matrix of order with coefficients in GF(). Let denote an n-dimensional vector space over GF(). can be considered as a GF()[X]-module denoted by by defining:
[TABLE]
where GF. Let be a fixed partition of and . Set . If the partition has parts then we define
[TABLE]
Let be any partitions such that Then is the number of chains of sub-modules of in which the factor is isomorphic to
4.1 Green Polynomial
Let be partitions of . Assume that the polynomials
[TABLE]
the sum being taken over all sequences () of partitions of such that are partitions of 1 and are partitions of etc. are known as Green Polynomials. The Green Polynomials are closely related with the characters of the symmmetric groups. In fact it is known [3] that if is a partition conjugate to and -1) then is equal to the coefficient of in . Green Polynomials satisfy the following orthogonality relations:
If be any partition of then
[TABLE]
where the summation is over all pairs of partitions and , where . Here if and then the partition is defined to be the partition 2. 2.
Let be partitions of then
[TABLE]
where is the order of the centralizer (in ) of an element of an element in corresponding to the partition .
Green [1] gives a table of the polynomials for . Morris’s paper [7] deals mainly with these polynomials and a method of their determination. He also gives a table of these polynomials for .
4.2 -Variables and -Functions
Let be a partition of . Then a formal set of variables is called a set of -variables, and each member of the set is called a -variable. For each positive integer there are -variables namely . Each of these -variables is said to have degree deg(, . To each of these -variables of degree there correspond variables called the roots of or simply -roots and are written as: . These -roots can be thought of as the characteristic roots of a typical class of . Let denote the set of all irreducible monic polynomials over GF(). A mapping such that divides for each is called a substitution of into . We can apply a substitution to -roots as well. For each we choose any root of and define . Two substitutions and of into are said to be equivalent if there is degree preserving permutation of such that . A class of equivalent substitutions is called mode of substitution. Let be a substitution of into and let be of degree . For each positive integer let . Then we define It is easily seen that two substitutions and are equivalent if and only if for all . So if denotes the equivalence class of substitutions to which belongs, we can write without ambiguity . We shall also talk of substitutions of into a class of . If is a conjugate class of then a substitution of into satisfying for all will be called a substitution of into the class .
Example: Let and where both and are of degree one. So in this case we have and there are two modes of substitutions of into , the representative substitutions being:
[TABLE]
[TABLE]
Substitutions can also be applied to -roots. For each choose any root of and define . For our purposes it would be irrelevant what root is chosen.
4.3 -Functions
A -function is a function of -variables. It is a complex-valued function on the set of modes of substitutions of into . It can also be considered as a function of -roots if we write
[TABLE]
Let be a root of . Then
[TABLE]
where is the mode of the substitution .
4.4 Uniform Functions
For each partition of let there be a given a -function . Then a uniform function U on is the class function whose value on the class is given by:
[TABLE]
Here summation is taken over all partitions of and all modes of substitutions of into the class , and
[TABLE]
The functions are called the principal parts of and is its -part. A uniform function whose principal parts are all zero except for is called Basic Uniform Function of type . Consider the subgroup of consisting of the matrices of the form:
[TABLE]
where and . Green [1] has shown that if and are uniform functions on and respectively then the function induced on by the function is a uniform function on . This induced uniform function on will be denoted by .
5 Calculations of And
In this section we shall describe the computations of the values of the functions and . These functions are in a way dual to each other with respect to characters of . Their definition is similar in as much as the Green Polynomials occurring in the definitions are replaced by the characters of the symmetric groups in the definition of , whereas, of course, the class is replaced by the dual class . For a given partition and for a given class and dual class we have:
[TABLE]
and
[TABLE]
As has been pointed out earlier here is the mode of substitution of into the class and is the order of centralizer (in the symmetric group) of an element represented by the partition . If there are more than one modes of substitutions we get more than one such functions (as happens in the case of and the classes ).
Given the partition and the class we first find the mode(s) of substitutions of into . For each mode we evaluate the coorresponding and . We read the value of from the table in Green [1] for each irreducible polynomial appearing in class , and can thus compute the value of .
Examples
Let and , so . There is only one mode of substitution of into whose representative substitution being and . So . Now
2. 2.
Let . So . There are two modes of substitutions of into namely: The mode and the mode . We have . So and .
The determination of the functions is similar excepting for the fact that the class is replaced by the dual class and the irreducible polynomials are replaced by the simplexes and the Green Polynomials are replaced by the characters of the symmetric groups. As a matter of fact in most cases the value of is equal to the coefficient of the highest power of occurring in the corresponding . The table 3 and table 4 (resp.) give the values of and (resp.) for all classes and dual classes , and for all partitions of 5.
6 Basic characters
The Basic Characters are the basic constituents of the irreducible characters of . The 42 types of irreducible characters of can be grouped into 17 categories such that the characters in the same category involve the same basic constituents namely the basic characters. Roughly speaking these basic characters express the irrationalities involved in the irreducible characters.
Let be a partition of and let denote the vector whose components (which are integers) correspond to parts of . Then the basic character of type is defined to be the character
[TABLE]
of where is a character of defined as: if the class is not primary and where is a root of the polynomial and is a generating character of the the group and we have abbreviated as . is a basic uniform function whose -part is given by the expression
[TABLE]
where the summation is over all permutations of and
[TABLE]
Actually makes sense only if is a root of an irreducible polynomial over . However when a substitution is applied to , a -root is transformed into a root of an irreducible polynomial over . The value of at a class is given by
[TABLE]
where the summation is taken over all modes of substiitutions of into the class .
6.1 Simplex and Dual Classes
Let be an irreducible polynomial of degree over . Let be a generator of . Then a root of has the form where is uniquely determined modulo(), and the set {} consists all the roots of . Recall that the set { } is an -simplex with as its roots and its degree. It is clear that there are as many simplexes of degree as there are irreducible polynomials of degree over . As before the set of all s-simplexes for will be denoted by and a particular simplex by the letter . For each partition , let denote the set of -variables {}. The -variable is considered to be of degree . A mapping is called a substitution of into if divides . The notions of equivalenc of two substitutions, mode of a substitution and the partitions are defined exactly in the same manner as for the substitutions of into . A function such that specifies what is called a dual class and will be denoted by the symbol . To each symbol of dual class there will correspond a character which will be denoted by the same symbol. For a fixed partition of let be the mode of certain substitution of into the set of all simplexes. Set , where is a root of the simplex and is the degree of
We shall now describe the computation of -parts of the basic characters of for a partition of corresponding to a given symbol of a dual class of . First we find the modes of substitution of into , then for each mode we find the integers defined above. Then the -parts of the basic character for the mode corresponding to the irreducible character given by the symbol of the dual class is given by
[TABLE]
where now are all integers and so the value of the above expression can be calculated.
For example let . Then . It is easily seen that there is only one mode of substitution of into and a substitution belonging to this mode is given by . Also , where is a root of , and where is root of . So and the -part of the basic character corresponding to the symbol of the dual class is:
Let us determine the value of this basic character on class of type say . We first find the modes of substitutions of into . As there is only one mode of substitution whose representative substitution maps each of the -variable into . According to our notation the root of the polynomial can be expressed as . So we have and ,where we recall is a primitive -th root of unity. The value of this basic charcater is same on every class of type namely on each of the classes .
Table 6 gives the value of the -part of each of the types of basic characters on each of the types of classes corresponding to each partition of for the . Whenever there is more than one mode of substitution we have mentioned it explicitly. If the value of a basic character corresponding to a partition is missing then it should be understood that there is no mode of substitution - either into the symbol of a dual class or into the class .
7 Irreducible Characters of
The character of corresponding to the dual class of is given Green [1] by the expression
[TABLE]
where the summation is over all the partitions , of and over all modes of substitutuions of into the dual class . The degree of this character is given by the expression
[TABLE]
where and if is a partition of with parts then
[TABLE]
where . Now to calculate the value of , for a specific partition , at a class of we write as simply and keep in mind that now is a specific sequence of integers whose value is uniquely determined by the partition of and the mode of substitution of into . Recall that the value of at a class of is given by the expression , where the summation over all modes of substitutions of into the class and is the -part of the basic character corresponding to the dual class whose value has already been determined (table [6] ). The values of the functions have been determined earlier (table [3] ). We do this for each partition of and for all modes of substitutions of into the dual class and further for all modes of substitutions of into the class . It may appear that it is an involved process but in the case of the computations are managebale. We shall give two example of explicit computation of values of characters of .
Examples
Let us determine the value of the character of type which corresponds to the dual class on the class (class symbol . For each , there is only one mode of substitution of into the dual class namely each variable mapping into . Similarly for each , there is only one mode of substitution of into the class . So in this case for each , we find the value of corresponding to the dual class , multiply it with the value of for corresponding and , and with the -part of the basic character of type and add these up. Thus we get the following value for this character on given class:
[TABLE]
[TABLE]
which when simplified reduces to . The degree of each of these characters (as computed by the degree formula mentioned earlier) is 2. 2.
Let us determine the value of the character of type on the classes of type . In this case there are two modes of substitutions for into the dual class of type as well as into the class of type . Also corresponding to there are no modes of substitutions of into , and corresponding to there are no modes of substitutions of into the class . Thus corresponding to the partitions and the contribution to the value of character is:
[TABLE]
To find the contribution corresponding to the partitions we have to take into consideration both the modes of substitutions. This contributions comes out to be
Adding the two contributions we get the value of the characters of type on the classse of type (as can be seen there is no contribution from the partitions ). This sum comes out to be equal to
[TABLE]
The degree of each of these characters as computed by the degree formula is
A complete listing of characters of is given in table 7.
Appendix
List of Tables
[TABLE]
TABLE # 1
REPRESENTATIVES OF CONJUGATE CLASSES OF GL(5,q)
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Table 2. CONJUGATE CLASSES.
[TABLE]
Table 2. CONJUGATE CLASSES (Cont’d).
[TABLE]
Table 2. CONJUGATE CLASSES (Cont’d).
[TABLE]
Table 2. CONJUGATE CLASSES (cont’d).
[TABLE]
Table 3. THE FUNCTIONS .
[TABLE]
[TABLE]
Table 3. THE FUNCTIONS (cont’d).
[TABLE]
[TABLE]
Table 3. THE FUNCTIONS (cont’d).
[TABLE]
[TABLE]
[TABLE]
Table 4. THE FUNCTIONS .
[TABLE]
[TABLE]
Table 5. DUAL CLASSES (TYPES OF CHARACTERS)
[TABLE]
Table 5. DUAL CLASSES (TYPES OF CHARACTERS) (Cont’d).
[TABLE]
Table 5. DUAL CLASSES (TYPES OF CHARACTERS) (Cont’d).
[TABLE]
Table 5. DUAL CLASSES (TYPES OF CHARACTERS) (Cont’d).
[TABLE]
Note: The contribution from the basic character corresponding to the missing partitions is zero. The classes for which there is no contribution for any of the partitions have been omitted.
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
REFERENCES
-
J. A. Green, “The characters of general linear groups.” Trans. Amer. Math. Soc. 80(1955), 402-447.
-
S. K. Gupta, Ph.D. thesis, Case Institute of Technology 1971.
-
D. Littlewood, The theory of groups characters and matrix representation of groups. Oxford. 1958.
-
D. Littlewood, “On certain symmetric functions.” (3) 11 (1961), 485-498.
-
I.G. Macdonald, Symmetric functions and Hall polynomials. Clarendon Press. Oxford 1979.
-
Alun O. Morriss, “The characters of the groups ”. Math. Z. 81(1963), 733-742.
-
Alun O. Morriss, The multiplication of Hall Functions.” Proc. London Math. Soc. 3(13) 1963, 733-742.
-
W. Specht, “Die Characters der Symmetrischen Gruppe.” Math. Z. 73(1960) 312-329.
-
T. Springer, Characters of special groups. Lecture Notes in Mathematics. No. 131, Springer Verlag, 1970.
-
R. Steinberg, Ph.D. Thesis, University of Toronto, 1948.
-
R. Steinberg, “The representations of .” Canad. Jour. of Math. 3 (1951),225-235.
-
R. Steinberg, “A geometric approach to the representations of the full linear group over a Galois field.” Trans. Amer. Math. Soc. 71(1951), 274-282.
