Computational Problems in Abstract Algebra. Proceedings of a Conference Held at Oxford Under the Auspices of the Science Research Council Atlas Computer Laboratory, 29th August to 2nd September 1967

Content: 
Front Matter, Page iii
Copyright, Page iv
Foreword, Pages vii-viii, J. HOWLETT
Preface, Pages ix-x, JOHN LEECH
Investigations of groups on computers, Pages 1-19, J. NEUBÜSER
Coset enumeration, Pages 21-35, JOHN LEECH
Some examples using coset enumeration, Pages 37-41, C.M. CAMPBELL
Defining relations for subgroups of finite index of groups with a finite presentation, Pages 43-44, N.S. MENDELSOHN
Nielsen transformations, Pages 45-46, M.J. DUNWOODY
Calculation with the elements of a finite group given by generators and defining relations, Pages 47-57, H. JÜRGENSEN
On a programme for the determination of the automorphism group of a finite group, Pages 59-60, V. FELSCH, J. NEUBÜSER
A computational method for determining the automorphism group of a finite solvable group, Pages 61-74, L. GERHARDS, E. ALTMANN
Combinatorial construction by computer of the set of all subgroups of a finite group by composition of partial sets of its subgroups, Pages 75-82, W. LINDENBERG, L. GERHARDS
A programme for the drawing of lattices, Pages 83-87, K. FERBER, H. JÜRGENSEN
The construction of the character table of a finite group from generators and relations, Pages 89-100, JOHN McKAY
A programme for the calculation of characters and representations of finite groups, Pages 101-110, C. BROTT, J. NEUBÜSER
The characters of the Weyl group E8, Pages 111-130, J.S. FRAME
On some applications of group-theoretical programmes to the derivation of the crystal classes of R4, Pages 131-135, R. BÜLOW, J. NEUBÜSER
A search for simple groups of order less than one million, Pages 137-168, MARSHALL HALL Jr.
Computational methods in the study of permutation groups, Pages 169-183, CHARLES C. SIMS
An algorithm related to the restricted Burnside group of prime exponent, Pages 185-187, E. KRAUSE, K. WESTON
A module-theoretic computation related to the Burnside problem, Pages 189-198, A.L. TRITTER
Some combinatorial and symbol manipulation programs in group theory, Pages 199-203, JOHN J. CANNON
The computation of irreducible representations of finite groups of order 2n, n ≤ 6, Pages 205-216, P.G. RUUD, R. KEOWN
Some examples of man—machine interaction in the solution of mathematical problems, Pages 217-222, N.S. MENDELSOHN
Construction and analysis of non-equivalent finite semigroups, Pages 223-228, ROBERT J. PLEMMONS
Some contributions of computation to semigroups and groupoids, Pages 229-261, TAKAYUKI TAMURA
Simple Word Problems in Universal Algebras, Pages 263-297, DONALD E. KNUTH, PETER B. BENDIX
The application of computers to research in non-associative algebras, Pages 299-305, LOWELL J. PAIGE
Identities in Jordan algebras, Pages 307-313, C.M. GLENNIE
On property D neofields and some problems concerning orthogonal latin squares, Pages 315-319, A.D. KEEDWELL
A projective configuration, Pages 321-323, J.W.P. HIRSCHFELD
The uses of computers in Galois theory, Pages 325-328, W.D. MAURER
An enumeration of knots and links, and some of their algebraic properties, Pages 329-358, J.H. CONWAY
Computations in knot theory, Pages 359-364, H.F. TROTTER
Computer experiments on sequences which form integral bases, Pages 365-370, SHEN LIN
Application of computer to algebraic topology on some bicomplex manifolds, Pages 371-381, HARVEY COHN
A real root calculus, Pages 383-392, HANS ZASSENHAUS
Some computational problems and methods related to invariant factors and control theory, Pages 393-398, R.E. KALMAN
List of participants, Pages 399-402