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.

70 L. Gerhards and E. Altmann<br />

(a) Let F/(1 = 1, . ..) Ai) be the different fix groups of I&, k (i, k =<br />

1 . .,r,i + k)andletN@)nP,(Y = 1 vi) be the different characteristic<br />

s;bgroups of Pi induced by the N@)ciai*i’and also different from all characteristic<br />

subgroups of Pi used by the determination of A(PJ. Each group<br />

Fj’), NO n Pi determines a partitiont 8.;a) = [Fp, pi-@)], @ = [NWnpi,<br />

Pi-(iV(“‘n Pi)] of Pi respectively. TO the partition<br />

there corresponds a well-defined partition of the set { 1, . . . , 1 Pi I} :<br />

(il, . . .,“ieJ, &fl, . . -,“iq+eJ, *. .Y t.ie,+ *..+.$-1+1,-. .,.iq+...+e*)<br />

( ilez= lpi/) (5.3)<br />

Now we calculate the permutation Q~< of the set { 1, . . . ,I Pi I} related to the<br />

automorphism zi C A(Pi) given by the images nip?) of a generating system<br />

{pJ’)} of Pi (cf. B, 0 4). Then 3ti E A*(PJ if and only if en, maps the classes of<br />

the partition (5.3) complexwise into themselves.<br />

(4 If fyi = wy{(pp),fy& = w$~gJp), . . . , fyi. = wyjJpp><br />

fy”$ = qy(p!P)),),~~ , t = qQp,!P)) , t 9..*, f;ui. ,t = +~~i(pp9;<br />

is a generating system of GA), N(“)n Pi respectively - represented as words<br />

of the elements ~$9’ of a generating system {#} of Pi - then ni E A*(Pi) if<br />

and only if both<br />

?Zjf$f) = Wj$ (nipi”) E F? for A = 1 ,***, 3.. ‘I, j= 1, . ..yhi<br />

and niJ’I,“J = Wj,‘: (PZ&‘)) EN(“) n Pi for v = 1, . a ey Vi; j = 1, . . ., hi.<br />

(h) Determination of I!” I (i = 1 , ..*, r; j = 2, . . .) r; i=i=k)(cf. flow<br />

chart).<br />

(a) Determination of I/j) (1 6 i =S r ; 2 =~j =S r). Let 8j“) (k = 1, . . . , j; i + k)<br />

be the coset decomposition of Pi by Ni@), then, similarly to (g) (5.3), the<br />

greatest common refinement /( 8;“) = pj”h N!k)+ . . . +p$“)b N{‘) correk=l<br />

k=l<br />

k+i<br />

;;i’<br />

sponds to a well-defined partition of the set:;: . . . , jPij}, which can easily be<br />

determined. Those Xi E A*(Pi), the corresponding permutations eni of which<br />

map the class of the partition of {I, . . . , 1 PiI } related to h N’k) into itself<br />

k=l<br />

k*i<br />

t A non-empty system 8 of non-empty subsets Ns M of a set M+ 0 is called a partition<br />

of M if and only if each element of M is contained in only one set N E 8. The subsets<br />

NE M are called the classes of the partition 8, The greatest common refinement of the<br />

partitions a1, 82 of M formed by all non-empty intersections of the classes of B1, se<br />

is denoted by & x &.<br />

Automorphism group of finite solvable group 71<br />

and a representative z of every other class into an element Z of the same<br />

class, belong to the group 1:” if and only if for all pp’ E {pp’} of Pk (cf.<br />

Theorem 2.2) :<br />

njOpkiOnlT1= pkt A .<br />

k=l,.. ..j<br />

k+i<br />

(5.4)<br />

The test of e quality for the relations (5.4) however is equivalent to comparing<br />

multiplication of permutations in an abbreviated form (cf. Theorem<br />

2.2):<br />

C?n$k ’<br />

.<br />

en<br />

-l=pki A , (5.5)<br />

k=l,...,j<br />

k+i<br />

for the test of (5.4) is restricted on the generating systems {p/“)} and {nip{‘)}<br />

of Pj.<br />

(/l) Determination of Ii(j+‘) using&@. By use of the coset decomposition $+”<br />

of Pi by Nyfl), the partition of { 1, . . . , IPil} related to the partition i 8$k),<br />

k=l<br />

k+i<br />

which has been needed by the construction of Z?, can be easily refined.

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

Saved successfully!

Ooh no, something went wrong!