05.01.2013 Views

COMPUTATIONAL PROBLEMS IN ABSTRACT ALGEBRA.

COMPUTATIONAL PROBLEMS IN ABSTRACT ALGEBRA.

COMPUTATIONAL PROBLEMS IN ABSTRACT ALGEBRA.

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

106 C. Brott and J. Neubiiser Group characters and representations 107<br />

(4.4.1) THEOREM. The dimension of an irreducible representation of a group<br />

H is a divisor of the index of each abelian normal subgroup A of H.<br />

We call the greatest common divisor of the indices of the maximal abelian<br />

normal subgroups of H the It&index i(H). By (4.4.1) we have to find a subgroup<br />

U== N such that G: U 1 i(G/N). In order to determine i(G/N) we search<br />

for Kj a G with N a Ki, K,/N abelian, and maximal with respect to these<br />

properties. Then i(G/N) is calculated from the orders of the Kt listed in LI.<br />

We also use 2 d,? = 1 G I. As there are IG/G’I one-dimensional represen-<br />

i=l<br />

tations, only r - IG/G’I representations of dimensions a 2 are missing. For<br />

their dimensions we have:<br />

i:<br />

i=p/~'l+i<br />

d;= IGI-IG/G’I.<br />

Hence2eG: U< 1/lGl- IG/G’I -4(r- IG/G’I - 1) is a restriction for<br />

the index of U.<br />

Finally we can restrict the search for U to representatives of the classes<br />

of subgroups conjugate under G, as conjugate subgroups yield equivalent<br />

representations.<br />

The kernel V a U of the one-dimensional representation T of U used for<br />

the induction process must satisfy the requirements<br />

U/V cyclic, (4.4.2)<br />

N = ker TG = n Vg. (4.4.3)<br />

HG<br />

The programme X deals with all factor groups G/N with faithful irreducible<br />

representations in turn. If G/N cannot be recognized as an M-group<br />

by (4.3.2), the user of the programme is informed that possibly not all<br />

irreducible representations of G/N will be found. In spite of this, the programme<br />

tries to find irreducible monomial representations of G/N.<br />

First, the programme searches for subgroups U c Es,, s < t- 1, such that<br />

N a U and G : U is a dimension allowed by the restrictions. Then subgroups<br />

VC &, i< s- 1, V a U are searched for, which satisfy (4.4.2) and (4.4.3).<br />

This is done in the following way: if V a G then also V a U. Otherwise the<br />

normalizer N,(V) is determined from Lz and LB. If U=S No(V) we have<br />

V a U. U/V is cyclic if and only if for each prime pi j U/V I there is exactly<br />

one maximal subgroup of index p in U, containing V. If V a G we must<br />

have V = N, otherwise the intersection of all conjugates of V in G is formed<br />

and this must be equal to N. If V is found, meeting all requirements, N, U<br />

and V are listed.<br />

For the determination of faithful one-dimensional representations of<br />

U/V we have to find an element x E U with (x, V) = U. This is found as a<br />

generator of a cyclic subgroup 2 of G meeting the following requirements :<br />

2~ U, Z=k V and ZV*/= Mi for all maximal subgroups Mi of U containing<br />

v.<br />

The whole process described in 9 4.4 needs only calculations with characteristic<br />

numbers and hence is rather fast.<br />

4.5. A test for irreducibility. We use the inner product of characters<br />

to check the irreducibility of TG. By a special case of Frobenius’ reciprocity<br />

theorem ([2], 38.8), for any character y of a subgroup U< G we have:<br />

((YG>U, Y.l = (YG, Y3. (4.5.2)<br />

Since a character x of a representation of G is irreducible if and only if<br />

(x, x) = 1, we have:<br />

yG is irreducible if and only zf<br />

((Y3r.h WI = &-p(U)~(U) = 1.<br />

Let e be the exponent of G. Then the values of yG, and hence (UI *((yG)o, y),<br />

are sums of eth roots of unity, i.e. sums of powers of a fixed primitive<br />

eth root of unity, E say.<br />

For the calculation of the sum (4.5.2) we count in a list L the number nj<br />

of times ej, 0 ~j < e - 1, occurs as a summand of I U/ * ((Y~)~, y). We then<br />

use the fact that a sum of nth roots of unity is equal to zero if and only if it<br />

can be decomposed into sums over cosets of nontrivial subgroups of the<br />

group of al lnth roots of unity ([9], p. 240). Because of this theorem the programme<br />

proceeds as follows : for each divisor d of e and each i, 0 =S i =S d- 1,<br />

the smallest of the numbers ni, nd+i, nw+i, . . . is subtracted from all<br />

these numbers. yG is irreducible if and only if, after doing this, no = 1 Ul<br />

andni = Oforalli, lsiee-1.<br />

4.6. The calculation of induced representations. The programme deals in<br />

turn with the triplets N, U, V previously found. First G is decomposed into<br />

cosets of U, then for each faithful one-dimensional representation Ti of<br />

U/V the calculation is performed in four steps:<br />

(1) Ti is calculated in the same way as described in 9 3.3 for the onedimensional<br />

representations of G.<br />

(2) The character-values xl” of the induced representations TjG are calculated<br />

for representatives of the classes of elements conjugate in G.<br />

(3) The irreducibility of Ty is tested by the method described in 0 4.5.<br />

(4) If q passes the test, the values of x$j) are brought into a normal form<br />

by a method analogous to that described in 9 4.5, and are compared<br />

with the list of irreducible characters previously obtained in order to<br />

decide if 7 is a new irreducible representation.<br />

If required the kernel of 7, the matrices representing generators or all

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!