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.

186 E. Krause and K. Weston<br />

mk}, mi = W$(Xl, . . ., x,), we show here an easy method to calculate A,<br />

from the matrices M6(g(xl)), . . . , M,(g(x,J).<br />

IfIi, . . . . & is the natural basis for A, then by (1)<br />

Ai @ Aj = M&(mj)) X Ai<br />

(i.e. 1i@ & = the ith column of M&(mj))). Thus a multiplication table<br />

for A, is easily calculated by observing the columns of the matrices<br />

~,tdml)), . . -, M&(mk)).<br />

Because of our convention of writing operators on the left, the inner derivation<br />

g is a Lie anti-homomorphism of L into the algebra of linear operators<br />

:<br />

de-m) = [g(m), g(e)1 = - Me>, g(m>l, e, m EL, where V’, Sl = TS’-- ST,<br />

S, T linear operators. Also MP(g(e.m)) = [MB(g(m)), h$(g(e))] or more<br />

generally<br />

%&tel, . , . , ej)> = t- l)j+1W&ted)9 ~&te2)), . . -, ~&dej))l. (2)<br />

Consequently (2) affords a simple formula for calculating M&(mi)),<br />

i= 1,. . . , k from the matrices MB(g(xr)), . . . , J@g(x,)).<br />

Therefore, with restrictions on the size of k of course, one can use a computer<br />

to calculate and even print the multiplication table of A, given the<br />

matrices ~&d~l)), . . ., ~&tx,)).<br />

Algorithm for L(p, n, m) (m -= p). Designate L(p, n, m) by L; since<br />

m-=p, L(p, n, m) is nilpotent of class c [2]. We wish to use Theorems 1 and 2<br />

to determine a basis p for L/Lk (k = 1,2, . . . , c) from the bases of L/L=, . . . ,<br />

Lkm2JLk-l. Therefore A, 2 L[Lk by Theorem 1.<br />

Suppose L is generated by x1, . . . , x, and LIx/La+l (a = 1, . . . , x- 1)<br />

has a basis consisting of monomials p@ = {m,, l+La+l, . . . , m,,jl+La+l}<br />

m,, ji = m, jc (Xi, . . . , x,J. Next select any set of monomials<br />

Pk-i = {mk-1, l+Lk, . . ., mk-l,jkel+Lk}, mk-l,jr = mk-1, ji(Xi, . . . , Xn)<br />

which span L k - ’ IL k . For example &-l could COnSist of all of the<br />

monomials with k- 1 factors. Then L/r;” is spanned by<br />

B = {ml,l+Lk, . . . , ml, j,-tLk, . . . . , mk-l,lfLk, . . ., mk-l,jkel+Lk}<br />

and p constitutes a basis if and only if fl&., is a basis. Thus if A, is a Lie<br />

algebra over GF(p) on n generators satisfying the mth Engel condition,<br />

then A, % L/Lk by Theorem 2. Hence, by Theorem 1, fl is a basis, which in<br />

turn implies that p&1 is a basis. If A, fails to satisfy any of the above conditions,<br />

,$+i must be a set of dependent vectors. Thus we have to select a<br />

proper subset spanning Lk-‘/Lk and repeat the process.<br />

This process of course only affords us a check whether a basis has been<br />

found for Lk-l/Lk and does not actually calculate one except by trial and<br />

error. The use of a computer to calculate A, has already been mentioned.<br />

A computer may be used also to scan the multiplication table of A, and<br />

determine which of the conditions of Theorem 2 are fulfilled by A,. A pro-<br />

_<br />

Restricted Burnside group of prime exponent 187<br />

gram for determining whether A, is a Lie algebra on n generators satisfying<br />

the mth Engel condition is on file in the Computing Science Library of the<br />

University of Notre Dame.<br />

REFERENCES<br />

1. E. KRAUSE and K. W ESTON: The restricted Burnside group of exponent 5 (in preparation).<br />

2. A. KOSTRIK<strong>IN</strong>: On locally nilpotent Lie rings satisfying an Engel condition. Doklady<br />

Akademii Nauk SSSR (1958), 1074-7.

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

Saved successfully!

Ooh no, something went wrong!