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.

146 Marshall Hall Jr. Simple groups of order less than one million 147<br />

It is easy to find that if N(2)/C(2) is of order 3 then N(2) has a factor group<br />

of order 2, and so by Grim’s theorem G has a normal subgroup of index 2.<br />

Hence if g is divisible by 8 but not by 16, we may restrict our search to<br />

orders which are also multiples of 7. We have incidentally proved the<br />

uniqueness of the groups PSL2(q) as the only simple groups of their order<br />

when g is divisible by 8 but not 16 or 7. In our list then there is a unique<br />

simple group of each of the orders 360, 7800, 885 720, as well as orders<br />

multiples of 4 but not 8, namely 9828 and 976 500, in each case the appropriate<br />

PSLz(q).<br />

A simple group G which is not minimal will contain some proper subgroup<br />

which is not solvable and so has a simple group as a composition<br />

factor. Hence G has a subgroup H and H has a normal subgroup K (possibly<br />

K = 1) such that H/K is a simple group. We call a factor group of a<br />

subgroup a section. Hence by John Thompson (1) we may confine our<br />

search to groups which have one of the simple groups listed as a section.<br />

Hereif[G:K]=tand [K: l]=k,andH/K=swehaveg=tsk.If<br />

the simple group H/K is PSL2(p) for p == 41 then as g < 1,000,000,<br />

s z= IPSL2(41)j = 34 440 it follows that tk -= 30. Then [G : H] = t .C 30<br />

and so G has a permutation representation on t letters. But as p 2 41 G<br />

cannot represent an element of order p faithfully on less than 30 letters.<br />

Thus we may exclude as a section PSL&) with p z= 41. If PSLz(37) of<br />

order 25,308 is a section, then tk < 39, and since G is represented as a<br />

permutation group on t letters and contains an element of order 37, then<br />

k = 1, t =Z 39. Here H = G1 is the subgroup of G fixing a letter and, as<br />

PSL2(37) does not (from its character table) have a permutation representation<br />

on less than 38 letters, it follows that t = 39. Then the order of<br />

G is 25 308.39 = 987012 and by Gorenstein and Walter must be PSLz(q)<br />

with q = 3, 5 (mod 8) which it is not. If the Suzuki group Su(8) of order<br />

29 120 is a section of G, then tk < 34. Now Su(8) has as rational characters<br />

the identical character, one of degree 64 and another of degree 91. It has<br />

two algebraically conjugate characters of degree 14 both of which take<br />

the value - 1 on elements of order 5, three algebraic conjugates of degree<br />

35, and three algebraic conjugates of degree 65. From this it easily follows<br />

that Su(8) has no subgroup of index less than 65, and this of course corresponds<br />

to its representation as a doubly transitive group on 65 letters.<br />

Since Su(8) has an element of order 13 we must have t Z= 14, and as tk < 34<br />

then k = 1 or 2. With tk < 34 and either k = 1 or k = 2, the representation<br />

of G on 34 or fewer letters with G either Su(8) or the extension of<br />

Su(8) by a center of order 2 corresponds to a subgroup of Su(8) of index<br />

less than 65, which is a conflict. Hence no simple G has Su(8) as a section.<br />

PSL2(32) is of order 32 736 = 32.3 * 11.31. If PSL2(32) is a section of G<br />

then tk < 30, clearly a conflict as we cannot represent an element of order<br />

31 on 30 or fewer letters.<br />

Having eliminated the groups above as sections of G, and having shown<br />

easily that a section of a section is again a section, we have from John<br />

Thompson’s results in (1) that one of the following minimal simple<br />

groups is a section of G.<br />

Group Order<br />

P&(5)<br />

60 = 4.3.5<br />

P&(7)<br />

168 = 8.3.7<br />

PSLz@) 504 = 8.9.7<br />

PSLz(12) 1092 = 4.3.7.13<br />

PSL2(17) 2448 = 16~9.17<br />

P&(3) 5616 = 16.27.13<br />

PSL2(23) 6072 = 8.3.11.23<br />

PSL,(27) 9828 = 4.27.7.13<br />

From Gorenstein’s result (3) it follows that if the order of G is a multiple<br />

of 8 but not 16, then the centralizer of an involution t is not solvable and<br />

so H = COW/( z > is a non-solvable group of order a multiple of 4 but<br />

not 8. Hence H contains as a section one of the groups PSL2(5), PSLz(13)<br />

or PSLz(27) and so the order of G is a multiple of 8 * 3 * 5 -7 = 840 or of<br />

8.3.7.13 = 2184.<br />

On the basis of the above information we may divide the orders to<br />

be examined into seven lists, the orders being multiples of particular<br />

numbers.<br />

Form of g Number of orders<br />

A 16*3*5m = 240m 4166<br />

B 16.3.7m = 336m, m $ O(5) 2381<br />

C 8.3.5*7m = 840m, m odd 595<br />

D 8.3.7.13m = 2184m, m odd, $ O(5) 183<br />

E 16.9.17m = 2448m, m $ O(5), $ O(7) 280<br />

F 16+27*13m = 5616m, m $ O(5), $ O(7) 124<br />

G 16.3.11.23m = 12144m, m $ O(5), $ O(7) 57<br />

Total number of orders 7786<br />

As we have already remarked, if g is divisible by 8 but not 16 then g<br />

is also divisible by 7 and from the Gorenstein result (3) G contains PSL2(5),<br />

PSL2(13) or PSL2(27) as a section and so g is divisible by 5 or 13, giving<br />

lists C and D. For multiples of 16, g is certainly a multiple of 3. If g is a<br />

multiple of 5 or 7 it is included in lists A or B. If g is not a multiple of 5 or<br />

7 it contains PSLz(17), PSL3(3) or PSL2(23) as a section and so is listed in<br />

list E, F, or G. There are a few duplications between lists E, F, and G, but

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

Saved successfully!

Ooh no, something went wrong!