05.01.2013 Views

COMPUTATIONAL PROBLEMS IN ABSTRACT ALGEBRA.

COMPUTATIONAL PROBLEMS IN ABSTRACT ALGEBRA.

COMPUTATIONAL PROBLEMS IN ABSTRACT ALGEBRA.

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

154 Marshall Hall Jr.<br />

36 S(7)%, /N(7) 1 = 700 = 4.25~7<br />

50 S(7)%, ]N(7) 1 = 504 = 8.9.7<br />

120 S(7)‘s, <strong>IN</strong>(7) \ = 210 = 2.3.5.7<br />

225 S(7)%, lN(7) ) = 112 = 16.7<br />

400 S(7)%, 1 N(7) 1 = 63 = 9 -7<br />

1800 S(7)‘s, /N(7) 1 = 14 = 2.7<br />

We shall handle these separately. Except for 1800 S(7)‘s we have wri.<br />

In &(7) for 36 or 50 S(7)‘s we have a character of degree 6 or 8 in every<br />

case. By the Stanton condition in (8) we may exclude 36 or 50 S(7)‘s.<br />

For 120 S(7)‘s, /N(7) 1 = 2 * 3 * 5 * 7 and there are characters of degree 6 or<br />

8 to be excluded by the Stanton condition except for<br />

q = 2, w = 15, degrees i-16+15 = 0 (l+b&+s& = 0);<br />

q = 6, w = 5, degrees<br />

l-48+2(36)+2(-20)+15 = 0,<br />

if 120+2(-48)+2(-20)f 15 = 0.<br />

In all three cases we have a single character of degree 15, which is therefore<br />

necessarily rational. Hence on restriction to V(7) (writing ~15 for a<br />

character of degree 15)<br />

x15 1 Y(7) = Go+7 pz. (5.9)<br />

Here u. is the identity character for V(7) and ,LL~ a character of degree 2,<br />

necessarily rational since x15 is. But by the Schur result (3.13) a rational<br />

character of degree 2 can represent a group whose g order is divisible by<br />

at most 23* 3 = 24 and by no prime p * 5. But w = 15 or 5 and this conflicts<br />

with the Schur result if V(7) is to be faithfully represented, as it<br />

must be if G is simple.<br />

For 225 S(7)‘s <strong>IN</strong>(7)1 = 112 = 16.7 we must have q = 2, w = 8 and<br />

as the only degrees possible are if 5 - 6 = 0 the Stanton condition excludes<br />

this. Again for 400 S(7)‘s, <strong>IN</strong>(7)[ = 63 = 9.7, we must have q = 3,<br />

w = 3 and the degrees are all exchtded by the Stanton condition.<br />

For 1800 S(7)‘s <strong>IN</strong>(7)1 = 14 = 2.7 we have q = 2, w = 1. The possible<br />

degrees 1 + Sofa+ Sd2 = 0 are:<br />

1+5-6 = 0,<br />

l-16+15 = 0, (5.10)<br />

l- 9f 8=0.<br />

The first case may be excluded by Schur’s result since the rational character<br />

~6 cannot faithfully represent a group whose order is divisible by 25.<br />

Simple groups of order less than one million 155<br />

Here N(7) has the following defining relations: a7 = 1, b2 = 1, bab = a-l.<br />

The table of characters for N(7) is as follows:<br />

c(x) 14 7 7 7 2<br />

h(x) 1 2 2 2 7<br />

X 1 a a2 a3 b<br />

Al 1 1 1 1 1<br />

Al. 1 1 1 1 -1<br />

CL1 2 71 72 r/3 0<br />

P2 2 q2 qa 71 0<br />

P3 2 73 71 72 0<br />

(5.11)<br />

x is an element, h(x) the number of conjugates of x, c(x) the order of C,(x).<br />

Here 171 = E+ c-l, 72 = e2+ .sm2, 73 = E3+.sm3, where E is a primitive 7th<br />

root of unity, and ql+rj2+q3 = - 1<br />

From the Brauer results (3.3) the other degrees in (5.10) correspond to the<br />

following characters in G:<br />

g 7 7 7<br />

1 3600 3600 3600<br />

1 a a2 a3 b<br />

1 1 1 1 1<br />

15 1 1 1<br />

16 71 ~2 9-13<br />

16 712 r/s rll<br />

16 73 rll 772<br />

g 7 7 7<br />

1 3600 3600 3600<br />

1 a a2 a3 b<br />

1 1 1 1 1<br />

8 1 1 1<br />

9 71 72 73<br />

9 rl2 r/3 71<br />

9 73 r1 r/2<br />

(5.12)<br />

(5.13)<br />

Since g = 25200 = 16.9.25.7, the characters in (5.12) or, 02, 8s are of<br />

highest type for p = 2 and so vanish for b, a 2-singular element. All further<br />

characters for G have degrees multiples of 7 and vanish for a, a2, and a3.

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

Saved successfully!

Ooh no, something went wrong!