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.

,<br />

I<br />

The computation of irreducible representations<br />

of finite groups of order 2”, n 4 6’<br />

P. G. RUUD and R. KEOWN<br />

1. Introduction. Most textbooks and monographs on group representation<br />

theory include the statement that the construction of the irreducible<br />

representations of a particular group or family of groups is an art rather<br />

than a science. This paper is a contribution to the art in the case of 2-groups<br />

of order 2”, n < 6. The construction is based on the definitions of these<br />

groups given in the monumental work of Hall and Senior [5]. The authors<br />

and their colleagues have computed a representative element from each<br />

one of the classes of equivalent irreducible representations in the case of<br />

each class of isomorphic 2-groups of order 2” (n -= 6) and of numerous<br />

groups of order 64. An omission in the original program, whose correction<br />

is now believed understood, prevented the successful calculation of all<br />

of the representations of the groups of order 64.<br />

This collection of 2-groups contains many abelian and metacyclic<br />

groups for which a general theory of their representations exists. However,<br />

there are many 2-groups in the collection of Hall and Senior for which<br />

such a theory is not currently available. This paper is a description of a<br />

method of computation rather than a theory of the representations of<br />

2-groups. The calculation does not employ trial-and-error or iteration<br />

procedures.<br />

A monomial representation of a finite group G is a matrix representation<br />

T of G such that each matrix T(g), g c G, contains exactly one non-zero<br />

entry in each row and column. An induced monomial representation of G<br />

is any induced representation UG where U is a one-dimensional representation<br />

of some subgroup. It is known, see Curtis and Reiner ([3], pages<br />

314 and 356), that every irreducible K-representation of a finite nilpotent<br />

group G is an induced monomial representation. Every finite 2-group is<br />

known to be nilpotent. The defining relations of Hall and Senior provide<br />

an ascending normal series of the form<br />

(1) cH,c . . . CH, = G, (1.1)<br />

t This work was a collaboration between the authors and R. F. Hansen, E. R.<br />

McCarthy and D. L. Stambaugh.<br />

205

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

Saved successfully!

Ooh no, something went wrong!