A set of functions are provided for computing with the characters of a group. Full details of these functions may be found in Chapter CHARACTERS OF FINITE GROUPS. For convenience we include here two of the more useful character functions.
Also, functions are provided for computing with the modular representations of a group. Full details of these functions may be found in Chapter MODULES OVER A MATRIX ALGEBRA. For the reader's convenience we include here the functions which may be used to define a K[G]-module for a matrix group.
The functions described in this section apply only to finite groups for which a base and strong generating set may be constructed.
A sequence containing the linear characters for the group G.
Construct the table of irreducible characters for the group G. The characters are found using the Dixon-Schneider algorithm.
Given a group G and a subgroup H of G, construct the ordinary character afforded by the representation of G given by its action on the coset space of the subgroup H.
The natural R[G]-module for the matrix group G.
Let A be a matrix ring defined over the ring R and let G be a finite group defined on m generators. Let M denote the underlying module of A. Suppose there is a one-to-one correspondence between the generators of G and the generators [ A_1, ..., A_m ] of A. The function GModule creates the R[G]-module corresponding to an action of G on M defined by A, where the action of the i-th generator of G on M is given by A_i.
Let A be a matrix ring defined over the ring R and let G be a finite group defined on m generators. Let M denote the underlying module of A. Given a sequence Q of m elements of A, the function GModule creates the R[G]-module corresponding to an action of G on M defined by Q, where the action of the i-th generator of G on M is given by Q[i].
Let A and B be normal subgroups of G such that B is contained in A. Further, assume that A/B is elementary abelian of order p^n, p a prime. Let K denote the field of p elements. This function constructs a K[G]-module corresponding to the action of the group G on the elementary abelian section A/B of G. The map from A to the K[G]-module's underlying vector space is also returned.
The permutation module for G over the ring R defined by its action on the cosets of the subgroup H.
> G := MatrixGroup<4, IntegerRing(4) | > [ 3, 3, 1, 3, 0, 2, 2, 3, 3, 0, 1, 3, 3, 2, 2, 1 ], > [ 2, 2, 3, 3, 0, 3, 1, 1, 3, 0, 1, 1, 2, 0, 1, 2 ] >; > #G; 660602880 > H := pCore(G, 2); > FactoredOrder(H); [ <2, 15> ] > IsElementaryAbelian(H); true > M, f := GModule(G, H, sub<H|>); > SM := Submodules(M); > #SM; 3One of these submodules is 0, one is all M, we are interested in the one in the middle. Note that the result returned by Submodules is sorted by dimension.
> N := SM[2] @@ f; > N; MatrixGroup(4, IntegerRing(4)) Generators: [3 0 0 0] [0 3 0 0] [0 0 3 0] [0 0 0 3]We have found N, a normal subgroup of G, contained in the 2-core, with order 2.