COMPUTATIONAL PROBLEMS IN ABSTRACT ALGEBRA.

16 J. Neubiiser Investigations of groups on computers 17
Fe g. K. FERBER and H. JORGENSEN: A programme for the drawing of lattices. These
Proceedings, pp. 83-87.
Fl 1. S. FLODMARK: Theory of symmetry projections in applied quantum mechanics.
Phys. Rev. 132 (1963), 1343-1348.
Fl 2. S. FL~DMARK: Symmetry projection program. Mimeographed notes, Stockholm,
1964.
Fl 3. S. FLODMARK and E. BLOKKER: A computer program for calculation of irreducible
representations of finite groups. Znternat. J. Quantum Chem. Symposium 1
(1967), 703-711.
Fr 1. J.S. F~~~~:Thecharacters_ofthe Weyl groupE,.TheseProceedings.pp. 111-130.
Ge 1. I. M. GEL’FAND and Z. Y. SAPIRO: Representations of the group of rotations of
3-dimensional space and their applications. Uspehi Mat. Nauk (N.S.) 7 (47)
(1952), 3-117; A.M.S. Transl. (2) 2 (1956), 207-316.
Ge. 2. L. GERHARDT and E. ALTMANN: A computational method for the determination of
the automorphism group of a finite solvable group. These Proceedings, pp. 61-74.
Ge 3. L. GE RHARDS and W. LINDENBERG: Ein Verfahren zur Berechnung des vollstandigen
Untergmppenverbandes endlicher Gruppen auf Dualmaschinen. Numer.
Math. 7 (1965), l-10.
Gu 1. M. J. T. GUY: Coset enumeration. Lecture delivered at the Conference on Computational
Problems in Abstract Algebra, Oxford, 29 Aug.-2 Sept. 1967.
Ha 1. M. HALLJR.: Discrete variable problems, pp. 518-542 of J. Todd (ed.), A Survey
of Numerical Analysis (McGraw Hill, New York, San Francisco, Toronto,
London, 1962).
Ha 2. M. HALL JR. and D. E. KNUTH: Groups of exponent 4. Notices American Math.
sot. 11 (1964), 12%121.
Ha 3. M. H&L JR.: Generators and relations in groups-The Bumside problem,
pp. 42-92 of T. L. Saaty (ed.), Lectures on Modern Mathematics II (Wiley, New
York, London, Sydney, 1964).
Ha 4. M. HALL JR. and D. E. KNUTH: Combinatorial analysis and computers. Amer.
Math. Monthly 72 II (1965), 21-28.
Ha 5. M. HALL JR.: A search for simple groups of order less than one million. These
Proceedings, pp. 137-168.
Ha 6. P. HALL: A contribution to the theory of groups of prime power order. Proc.
London Math. Sot. (2) 36 (1933), 29-95.
Ha 7. P. HALL: The classification of prime power groups. J. reine angew. Math. 182
(1940), 130-141.
Ha 8. P. HALL: On the Sylow systems of soluble groups. Proc. London Math. Sot. (2)
43 (1937), 316-323.
Ha 9. D. R. HAYES: The calculation of the character-table of a given finite group.
Mimeographed notes, 1963.
He 1. W. HEWMAX Note on “An algebraic substructure algorithm”. Mathematical
Algorithms 1.2 (1966), 40.
Hi 1. G. HIGMAN: The orders of relatively free groups. Proc. Znternat. Conf. Theory of
Groups. Austral. Nat. Univ. Canberra, August 1965,153-165.
Hi 2. G. HIGMAN and J. MCKAY: On Janko’s simple group of order 50 232 960.
Bull. London Math. Sot. 1 (1969), 89-94.
Hu 1. D. R. HUGHES: A problem in group theory. Research problem 3. Bull. American
Math. Sot. 63 (1957), 209.
Hu 2. D. R. HUGHES and J. G. THOMPSON: The HP-problem and the structure of Hpgroups.
Pacific J. Math. 9 (1959), 1097-1101.
Ja 1. Z. JANKO: A new finite group with abelian 2-Sylow subgroups. Proc. Nat. Acad.
Sci. U.S.A. 53 (1965), 657-658.
Ja 2. Z. JANKO: Still one more new simple group of finite order. Mimeographed notes,
Melbourne, 1967.
Ju 1. H. J~~RGENSEN: Calculation with the elements of a group given by generators and
defining relations. These Proceedings, pp. 47-57.
Ka 1. S. KATSURA: Tables of representations of permutation groups for the many electron
problem. Unbound report, Eugene, Oregon, 1962, available as: Document
No 7567 AD1 Auxiliary Publications Project, Lib of Congr., Washington, D.C.
Ka 2. S. KATSIJRA: Tables of representations of permutation groups for molecular
integrals. J. Chem. Phys. 38 (1963), 3033.
Ke 1. E. R. KEO~N: The ordinary representations of the groups of order 2”, 14 n=n6.
Notices American Math. Sot. 14 (1967), 116.
Kr 1. E. F. KRAUSE: On the collection process. Proc. American Math. Sot. 15 (1964),
497-504.
Kr 2. E. F. KRAUSE: Groups of exponent 8 satisfy the 14th Engel congruence. Proc.
American Math. Sot. 15 (1964), 491-496.
Kr 3. E. F. KRAUSE and K. WESTON: The restricted Bumside group of exponent 5.
Notices American Math. Sot. 14 (1967), 416-417.
Kr 4. E. F. KRAUSE and K. WESTON: An algorithm related to the restricted Burnside
group of prime exponent. These Proceedings, pp. 185-187.
Le 1. J. LEECH: Some deiinitions of Klein’s simple group of order 168 and other
groups [with Appendix]. Proc. Glasgow Math. Assoc. 5 (1962), 166-175.
Le 2. J. LEECH: Coset enumeration on digital computers. Proc. Cambridge Phil. Sot.
59 (1963), 257-267; with supplementary notes and references, privately circulated
1967.
Le 3. J. LEECH: Generators for certain normal subgroups of (2,3,7). Proc. Cambridge
Phil. Sot. 61 (1965), 321-332.
Le 4. J. L&X-I: Coset enumeration. These Proceedings, pp. 21-35.
Li 1. W. LINDENBERG: Uber eine Darstellung von Gruppenelementen in digitalen
Rechenautomaten. Numer. Math. 4 (1962), 151-153.
Li 2. W. LINDENBERG: Die Struktur eines Ubersetzungsprogramms zur Multiplikation
von Gruppenelementen in digitalen Rechenautomaten. Mitt. Rh.- W. Inst. Instr.
Math. Bonn 2 (1963), l-38.
Li 3. W. LINDENBERG and L. GERHARDS: Combinatorial construction by a computer
of the set of all subgroups of a finite group by composition of partial sets of its
subgroups. These Proceedings, pp. 75-82.
Li 4. A. Lru~xvrcu~s: Coalgebras, resolutions, and the computer I, II, III. Mathematical
Algorithms 1.1 (1966) 4-12; 1.2 (1966) 2-10; 1.4 (1966) l-68.
Ma 1. M. D. MACLAREN: Notes on the machine computation of a spectral sequence.
Argonne Nat. Lab. Working paper (1965), 26 pp.
Ma 2. M. D. MACLAREN and M. E. MAHOW~D: Topological calculations by machine.
Argonne Nat. Lab. Working paper (1966), 14 pp.
Ma 3. R. N. MADDI~~N: Diploma Dissertation, Cambridge, 1958.
Ma 4. W. MAGNUS, A. KARRA.%S and D. SOLITAR: Combinatorial Group Theory (Interscience,
New York, London, Sydney 1966).
Ma 5. W. D. MAWR: Computer experiments in finite groups. Brown University
(1965), 30 pp.
Ma 6. W. D. MAURER: Computer experiments in finite algebra. Project MAC, M.Z.T.
Memorandum MAC M 246 (1965), 17 pp.
Ma 7. W. D. MAURER: Computer experiments in finite algebra II. Project MAC, M.I.T.
Memorandum MAC M 282 (1965), 39 pp.
Ma 8. W. D. MAURER: Computer experiments in finite algebra. Project MAC, M.Z.T.
(1966), 19 pp. Comm. Assoc. Comp. Mach. 9 (1966), 598-604.
Ma 9. W. D. MAURER: An algebraic substructure algorithm. Mathematical Algorithms
1.1 (1966), 101-113.
MC 1. J. K. S. MCKAY: Symmetric group characters. Algorithm 307. Comm. ASSOC.
Comp. Mach. 10 (1967), 451-452.