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.

104 C. Brott and J. Neubiiser<br />

irreducible representations can be found by applying a theorem of Gaschutz<br />

[5]. For this we give two definitions:<br />

(4.1.1) The socZe S(H) of a group His the product of ail minimal normal<br />

subgroups of H;<br />

(4.1.2) a normal subgroup of a group f-I is called monogenic, if it is<br />

generated by one class of elements conjugate in H.<br />

(4.1.3) THEOREM. A finite group H has a faithful irreducible representation<br />

if and only tf its socle S(H) is monogenic.<br />

In the programme this theorem is used in the following way: If Ng is<br />

transformed into Nh by Nx E G<strong>IN</strong>, then x-‘gxh-l EN. Hence to check if<br />

S(G/N) is monogenic means checking if the subgroup S 4 G with S/N =<br />

S(G/N) is generated by N and one class of elements conjugate in G. In<br />

preparation for this all monogenic normal subgroups Mi, 1 < i < s == r,<br />

of G are determined. Then for all N Q G, N E pi, 0 e i e t -2, where z; =<br />

{G}, the minimal normal subgroups Kj/N of G/N are found by searching<br />

for normal subgroups Kj * N minimal with respect to this property.<br />

S(G/N) is then equal to S/N where S is the product of all these 4. S(G/N)<br />

is monogenic if for some Mi we have S = NM,.<br />

4.2. Induced representations. Let U e G and M be a C&right-module<br />

of dimension s, T be the matrix representation afforded (uniquely up to<br />

equivalence) by M and let y be its character. The tensor product<br />

Ma = M@c&G (4.2.1)<br />

is a CG-right-module called the module induced from M. Let Tc be the<br />

matrix representation afforded by MC, I+’ its character, (@), the restriction<br />

of yG to U. To can be described as follows. Let<br />

G= UglUUgzU... UUg,, t = G:U and gl = 1, (4.2.2)<br />

be a decomposition of G into cosets of U. Then, for a suitable choice of<br />

the basis of MC, T”(g) is a t X t matrix of SXS blocks for all g E G. The block<br />

(i, j) is equal to T*(giggT’) where<br />

T*(x) =<br />

T(x) for xc U<br />

0 otherwise.<br />

If T is one-dimensional, TG is monomial and<br />

Then<br />

%> = T*tgiayl).<br />

(4.2.3)<br />

(4.2.4)<br />

(4.2.5)<br />

As a character is a class function, it is sufficient to calculate (4.2.5) for<br />

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

Group characters and representations 105<br />

4.3. M-groups.<br />

(4.3.1) A finite group is called an M-group if all its irreducible representations<br />

are monomial.<br />

As each irreducible monomial representation is induced ([2] Cor. 50.4),<br />

all irreducible representations of such groups are obtained as induced<br />

representations. In order to find M-groups among the factor groups we<br />

use a sufficient criterion of Huppert [6]:<br />

(4.3.2) THEOREM. Let H have a soluble normal subgroup K with all Sylow<br />

subgroups abelian such that H/K is supersoluble, then His an M-group.<br />

We also use the following remark from [6] :<br />

(4.3.3) A finite group H has a uniquely determined normal subgroup U(H)<br />

which is minimal with respect to the property that its factor-group is<br />

supersoluble. For K Q G we have U(H/K) = U(H)K/K.<br />

The programme first determines U(G). If G is supersoluble then U(G) = (1).<br />

Otherwise we use another theorem of Huppert [7]:<br />

(4.3.4) THEOREM. AJinite group H is supersoluble if and only ifall its maximal<br />

subgroups have prime index.<br />

So U(G) is found by searching through all layers Xi, i = O(l)t- 1, for the<br />

first normal subgroup such that all maximal subgroups of G containing it<br />

have prime index. For a factor group G/N, which has a faithful irreducible<br />

representation, U(G)N is formed. In order to decide whether G/N is an<br />

M-group U(G)N/N has to be checked for the following properties :<br />

(1)<br />

G;<br />

(b)<br />

(4<br />

1s U(G)N/N soluble?<br />

U(G)N/Nz U(G)/U(G) n N this can be decided in the following way:<br />

If U(G) is soluble, the same holds for U(G)N/N. Solubility of a subgroup<br />

of G is marked in La.<br />

If U(G) is insoluble, but N soluble, U(G)N/N is insoluble.<br />

Only if U(G) and N are both insoluble, the programme has to check<br />

if the derived series of U(G)N terminates below N.<br />

(2) Are ali Sylow subgroups of U(G)N/N abelian?<br />

If all Sylow subgroups of U(G) are marked as abelian in Lt, this is the<br />

case. Otherwise the programme described in 0 3.2 is used to find the Sylow<br />

subgroups of U(G)N/N and it is checked if their commutator subgroups are<br />

contained in N.<br />

As the property of being an M-group is inherited by factor groups, the<br />

.I.,<br />

checking of (1) and (2) is started with 20.<br />

4.4. Induced monomial representations. We now describe how a subgroup<br />

‘. V can be found whose one-dimensional representations yield irreducible<br />

representations of a fixed factor group G/N by the process of induction. The<br />

choice of U is restricted by a theorem of It8 ([2] Cor. 53.18):

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

Saved successfully!

Ooh no, something went wrong!