COMPUTATIONAL PROBLEMS IN ABSTRACT ALGEBRA.

18
J. Neubiiser
MC 2. J. K. S. MCKAY: A method for computing the simple characters of a finite group.
Mimeographed notes, 1966.
MC 3. J. K. S. MCKAY: The construction of the character table of a finite group from
generators and relations. These Proceedings, pp. 89-100.
Me 1. N. S. MENDELSOHN: An algorithm for the solution of a word problem. Notices
American Math. Sot. 11 (1964), 137.
Me 2. N. S. MENDELSOHN: An algorithmic solution for a word problem in group theory.
Canud. J. Math. 16 (1964), 509-516; Review by W. 0. J. Moser, Math. Rev. 29
(1965), 1248; Correction: Canad. J. Math. 17 (1965), 505; Corrected copy: University
of Manitoba, Reprint series 1966/l, Winnipeg.
Me 3. N. S. MENDELSOHN: Some examples of man-machine interaction in the solution
of mathematical problems. These Proceedings, pp. 217-222.
Me 4. N. S. MENDELSOHN: Defining relations for subgroups of finite index of groups
with a finite presentation. These Proceedings, pp. 43344.
Mol. W. 0. J. MOSER: Coset enumeration used to solve a word problem in groups.
Notices American Math. Sot. 13 (1966), 245.
M O 2. W. 0. J. MOSER: On the Todd-Coxeter and Reidemeister-Schreier methods. Lecture
delivered at the Conference on Computational Problems in Abstract Algebra
Oxford, 29 Aug.-2 Sept. 1967.
Ne 1. J. NEIJB~~SER : Untersuchungen des Untergruppenverbandes endlicher Gruppen
auf einer programmgesteuerten elektronischen Dualmaschine. Numer. Math. 2
(1960), 280-292.
Ne 2. J. NEIJB~SER: Bestimmung der Untergruppenverblnde endlicher p-Gruppen auf
einer programmgesteuerten elektronischen Duahnaschine. Numer. Math. 3
(1961), 271-278.
Ne 3. J. NEIJB~.~SER: Die Untergruppenverblnde der Gruppen der Ordnungen + 100
mit Ausnahme der Ordnungen 64 und 96. Habilitationsschrift, Kiel, 1967.
Ne 4. M. H. A. NEWMAN: The influence of automatic computers on mathematical
methods. Manchester University Computer Inaugural Conference (1951), 13.
No 1. L. M. NORTON: ADEPT. A heuristic program for proving theorems of group
theory. Ph.D. Thesis, MIT (1966), MAC TR 33.
Pa 1. G. PALL and E. SEIDEN: A problem in abelian groups, with application to the
transposition of a matrix on an electronic computer. Math. Comp. 14 (1960),
189-192.
Pa 2. E. T. PARKER and P. J. NIKOLAI: A search for analogues of the Mathieu groups.
Math. Comp. 12 (1958), 3843.
Pe 1. W. W. PETER~~N: Error-correcting Codes. New York, 1961.
Pi 1. T. B. PINKERTON: An algorithm for the automatic computation of integral homology
groups I, II. Mathematical Afgorithms 1.1 (1966), 36-66; 1.2 (1966),
33-39.
Ro 1. G. DE B. ROBINSON: Representation Theory of the Symmetric Group (Univ. of
Toronto Press, 1961).
RU 1. P. G. RUUD and E. R. I&OWN: Representations of groups of order 32. Notices
American Math. Sot. 14 (1967), 281.
Ru 2. P. G. RUUD and E. R. KEOWN: The computation of irreducible representations
of finite groups of order 2”, n =z 6. These Proceedings, pp. 205-216.
Sa 1. J. E. SAMMET: Survey of use of computers for doing non-numerical mathematics.
IBM, TR-00.1428, Poughkeepsie, N.Y.
Sa 2. J. E. S-T: An annotated descriptor-based bibliography on the use of computers
for doing non-numerical mathematics. IBM, TR-00.1427, Poughkeepsie,
N.Y.; and Comput. Rev. 7 (1966).
Sa 3. J. E. SAMMET: Modification No. 1 to “An annotated descriptor-based bibliography
on the use of computers for doing non-numerical mathematics”. Appendix
to SZCSAM Bulletin 5 (1966).
Investigations of groups on computers 19
se 1. R. SEG~VIA and H. V. MCINTOSH: Computer Analysis of Finite Groups. Inst.
Politecnico National, Mexico, 1966.
se 2. E. S. SELMER:
Bergen, 1966.
Translation-invariant permutation groups. Mimeographed notes,
Si 1. C. C. SIMS: On the group (2, 3, 7; 9). Notices American Math. Sot. 11 (1964),
687-688.
Si 2. C. C. &MS: The primitive groups of degree not exceeding 20. Mimeographed
notes, 1967.
Si 3. C. C. SIMS: Computational methods in the study of groups. Lecture delivered at
the Conference on Computational Problems in Abstract Algebra, Oxford,
29 Aug.-2 Sept. 1967. (This lecture included material not in [Si 41.)
Si 4. C. C. Sims: Computational methods in the study of permutation groups. These
Proceedings, pp. 169-183.
Sm 1. D. A. SIVIITH: A basis algorithm for finitely generated abelian groups. Mathematical
Algorithms 1.1 (1966), 14-35.
sp 1. G. P. SPIELMAN: Special interest form. SZCSAM BuZletin 7 (1967), 19.
su 1. E. H. SUSSENGUTH JR.: Structure matching in information processing. Ph. D.
Thesis, Harvard, 1964, Harvard Scientific Report ISRd
SW 1. J. D. SWIFT : Isomorph rejection in exhaustive search techniques. American Math.
Sot. Proc. Symp. in Appl. Math. 10 (1960), 195-200.
To 1. J. 4. TODD and H. S. M. COXETER: A practical method for enumerating co&s of
a finite abstract group. Proc. Edinburgh Math. Sot. (2) 5 (1936), 26-34.
Tr 1. A. L. TRITTER: A module-theoretic computation related to Bumside’s problem.
These Proceedings, pp. 189-l 98.
Tr 2. H. F. TROTTER: A machine program for coset enumeration. Canad. Math. Bull.
Tr 3.
7 (1964), 357-368.
H. F. TROTTER: A program for the Coxeter-Todd algorithm for the enumeration
of cosets in groups. Mathematical Algorithms 1.3 (1966), 12-18.
Wa 1. D. W. WALKU~: On a result of Heineken. Notices American Math. Sot. 10 (1963),
578.
Wa 2. G. E. WALL: On Hughes’ Hp problem. Proc. Znternat. Conf. Theory of Groups.
Austral. Nut. Univ. Canberra, August 1965,357-362.
Wel. M. WELLS: Enlargement of a group. Algorithm 136. Comm. Assoc. Comp. Mach.
5 (1962), 555.
Wh 1. M. E. WHITE: Modular arithmetic for finite groups. Notices American Math. Sot.
12 (1965), 52.
x7- x a I1.
R. YATES: Group analysis programs. Quantum Theory Project, University of
Florida, Gainesville, Florida, Program Note 5 (1963).
Za 1. G. ZAPPA: Contributo allo studio de1 problema di Hughes sui gruppi. Ann. Mat.
Pura Appl. (4) 57 (1962), 211-219.
Za 2. H. ZASSENHAUS: Uber einen Algorithmus zur Bestimmung der Raumgruppen.
Comment. Math. Helv. 21(1948), 117-141.