COMPUTATIONAL PROBLEMS IN ABSTRACT ALGEBRA.

14 J. Neubiiser Investigations of groups on computers 15
nent 8. Together with K. Weston [Kr. 3,4] he studied a similar process in
Lie rings and applied a programme for it in the study of Burnside groups of
exponent 5. D. W. Walkup [Wa 1] announces that he has used a computer
(in a way not further described) to show that a certain commutator identity
is best possible.
3.5.2. H. J. Bernstein, 0. Moller and E. Strasser Rapaport [Be 3]
describe a programme for finding factorizations of finite groups.
3.5.3. D. A. Smith [Sm 1] gives an algorithm for the determination of a
basis of a finitely generated abelian group.
4. Acknowledgements. The author wishes to express his indebtedness to
Mr. C. Brott, Mr. V. Billow, Mr. V. Felsch and Mr. J. K. S. McKay for
help in compiling and preparing the material for this article and to the
editor of these proceedings who patiently waited for its completion.
REFERENCES
Ai 1. N. N. ~ZENBERG and A. A. LETI~EVSKI!: On computing on “ECM” represen-
Al 1.
tations of wreath-products of finite groups. Kibernetika (Kiev) 1965, no. 3,
63-71; Math. Rev. 35 (1968), 4315.
S. L. ALTMANN and C. J. BRADLEY: A note on the calculation of the matrix elements
of the rotation group. Phil. Trans. Roy. Sot. London (A) 255 (1962/63),
193-198.
Al 2. S. L. ALTMANN and C. J. BRADLEY: On the symmetries of spherical harmonics.
Phil. Trans. Roy. Sot. London (A) 255 (1962/63), 199-215.
Ap 1. K. APPEL, M. HALL JR. and J. THOMPSON: A search for simple groups of odd
order. Notices American Math. Sot. 8 (1961), 364.
Ap 2. K. I. APPEL and E. T. PARKER : On unsolvable groups of degreep = + + 1, p and
q prime. Canad. J. Math. 19 (1967), 583-589.
Ba 1. P. A. BANDLER: M.A. Thesis, Manchester, 1956.
Be 1. C. T. BENSON and N. S. MENDEL~OHN: A calculus for a certain class of word
Be 2.
problems in groups. J. Combinatorial Theory 1(1966), 202-208.
R. BERGER: A computer method for testing for isomorphism between finite
groups. Mimeographed report for applied mathematics 220. Harvard Univ.
(1962).
Be 3. H. J. BERNSTEIN, 0. MOLLER and E. STRA~SER RAPAPORT: Machine factorization
Bi 1.
of groups. Mathematical Algorithms 1.3 (1966), 39-51.
R. L. BMNS, N. METROPOLIS, P. R. STEM and M. B. WELLS: Characters of the
symmetric groups of degree 15 and 16. Math. Tables and other Aids to Computation
8 (1954), 212-216.
Br 1. C. BROTT: Ein Programm zur Bestimmung absolut irreduzibler Charaktere und
Darstellungen endlicher Gruppen. Diplomarbeit, Kiel, 1966.
Br 2. C. BROTT and J. NEUB~~SER: A programme for the calculation of characters and
representations of finite groups. These Proceedings, pp. 101-l 10.
Bu 1. W. BURNSIDE: Theory of Groups of Finite Order (Cambridge Univ. Press, 1911).
Bil 1. R. BARLOW and J. NEUB~SER: On some applications of group-theoretical programmes
to the derivation of the crystal classes of R,. These Proceedings,
pp. 131-135.
Bii. 2. R. Bii~ow: Eine Ableitung der Kristallklassen im R, mit Hilfe gruppentheoretischer
Programme. Diplomarbeit, Kiel, 1967.
a 1. C. M. CAMPBELL: Some examples using coset enumeration. These Proceedings,
pp. 37-41.
a 2. J. M. CAMPBELL and W. J. LAMBERTH: Symbolic and numeric computation in
group theory. Proc. 3rd Austral. Comp. Conf. 293-296, Canberra, May 1966.
Ca 3. J. CANNON: Some combinatorial and symbol manipulation programs in group
theory. These Proceedings, pp. 199-203.
Co 1. S. COI&T: On the machine calculations of characters of the symmetric group.
Comptes Rendus, 12me Congres math. Scand. Lund, 1953 (1954), 18-23.
Co 2. S. COMBT: Notations for partitions. Math. Tables and other Aids to Computation
9 (1955), 143-146.
Co 3. S. CO&T: i)ber die Anwendung von Bin%rmodellen in der Theorie der Charaktere
der symmetrischen Gruppen. Numer. Math. 1(1959), 90-109.
Co 4. S. COMET: Improved methods to calculate the characters of the symmetric
group. Math. Comp. 14 (1960), 104-117.
Co 5. S. CO&T: Character tables for N&20 of the symmetric groups S,. Kept in the
library of Matematikmaskinnlmnden, P.O. Box 6131, Stockholm 6, Sweden.
Co 6. H. S. M. COXETER and W. 0. J. MOSER: Generators and Relations for Discrete
Groups, 2nd ed. (Springer, Berlin, Giittingen, Heidelberg, 1965).
Cu 1. C. W. CXJRTIS and J. REXNER: Representation Theory of Finite Groups and Associative
Algebras (Interscience, New York, 1962).
Da 1. E. C. DADE: The maximal finite groups of 4 ~4 integral matrices. Illinois J. Math.
9 (1965). 99-122.
De 1. J. ‘DBN&: Bibliography on application of digital computers in abstract algebra.
Mimeographed extract 1967 of: A bibliography on non-numerical applications
of digital computers. Comput. Rev. 9 (1968), 481-508.
Di 1. J. D. DIXON: High speed computation of group characters. Numer. Math. 10
(1967), 446-450.
El 1. H. ELTERMANN: Programmierung des Coxeter-Moser-Verfahrens zur Abz3ihlung
der Restklassen einer Gruppe nach Untergruppen auf Grund von definierenden
Relationen. Mitt. ZUz.- W. Inst. Znstr. Math. Bonn 2 (1963), 105-108.
Fa 1. G. FAST and T. W. JANSSEN: Non-equivalent four-dimensional generalized magnetic
space-time groups. Technical Report. Institute for Theoretical Physics,
University of Nijmegen, 1967.
Fe 1. H. FELL, M. NEWMAN and E. ORDMAN: Tables of genera of groups of linear
fractional transformations. J. Res. Nat. Bur. Standards, Sect. B, 67B (1963),
61-68.
Fe 2. H. FELSCH: Die Behandlung zweier gruppentheoretischer Verfahren auf elektronischen
Rechemnaschinen. Diplomarbeit, Kiel, 1960.
Fe 3. H. FELXH: Programmierung der Restklassenabz&hlung einer Gruppe nach Untergruppen.
Numer. Math. 3 (1961), 250-256.
Fe 4. H. FELSCH, J. NELJB~~SER and R. RUMBERGER: Gewinnung einer Permutationsdarstellung
einer Gruppe aus definierenden Relationen. Mitt. Rh.- W. Inst. Znstr.
.Math. Bonn 2 (1963), 75-104.
Fe 5. V. FELSCH: Ein Programm zur Berechnung des Untergruppenverbandes und der
Automorphismengruppe einer endlichen Gruppe. Diplomarbeit, Kiel, 1963.
Fe 6. V. FELSCH and J. NEUB~SER: Ein Programm zur Berechnung des Untergruppenverbandes
einer endlichen Gruppe. Mitt. Z?h.- W. Inst. Znstr. Math. Bonn 2 (1963),
39-74.
Fe 7. V. FEIXH and J. NEUBBSER: uber ein Programm zur Berechnung der Automorphismengruppe
einer endlichen Gruppe. Numer. Math. 11(1968), 277-292.
Fe 8. V. FELSCH and J. NEUB~~SER: On a programme for the determination of the automorphism
group of a finite group. These Proceedings pp. 59-60