http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
Computational problems in abstract algebra
Computational Problems in Abstract Algebra provides information pertinent to the application of computers to abstract algebra. This book discusses combinatorial problems dealing with things like generation of permutations, projective planes, orthogonal latin squares, graphs, difference sets, block designs, and Hadamard matrices.
Investigations of groups on computers / J. Neubüser -- Coset enumeration / J. Leech -- Some examples using coset enumeration / C.M. Campbell -- Defining relations for subgroups of finite index of groups with a finite presentation / N.S. Mendelsohn -- Nielsen transformation / M.J. Dunwoody -- Calculation with the elements of a finite groups given by generators and defining relations / H. Jürgensen -- On a programme for the determination of the automorphism group of a finite group / V. Felsch and J. Neubüser -- A computational method for determining the automorphism group of a finite solvable group / L. Gerhards and E. Altmann -- Combinatorial construction by computer of the set of all subgroups of a finite group by composition of partial sets of its subgroups / W. Lindenberg and L. Gerhards -- A programme for the drawing of lattices / K. Ferber and H. Jürgensen -- The construction of the character table of a finite group from generators and relations / J. McKay -- A programme for the calculation of characters and representations of finite groups / C. Brott and J. Neubüser -- The characters of the Weyl group E / J.S. Frame -- On some applications of group-theoretical programmes to the derivation of the crystal classes of R₄ / R. Bülow and J. Neubüser -- A search for simple groups of order less than one million / M. Hall Jr. -- Computational methods in the study of permutation groups / C.C. Sims -- An algorithm related to the restricted Burnside group of prime exponent / E. Krause and K Weston -- A module-theoretic computation related to the Burnside problem / A.L. Tritter -- Some combinatorial and symbol manipulation programs in group theory / J.J. Cannon -- The computation of irreducible representations of finite groups of order 2[superscript n], n [less than or equal to] 6 / P.G. Ruud and R. Keown -- Some examples of man-machine interaction in the solution of mathematical problems / N.S. Mendelsohn -- Construction and analysis of non-equivalent finite semigroups / R.J. Plemmons -- Some contributions of computation to semigroups and groupoids / T. Tamura -- Simple word problems in universal algebras / D.E. Knuth and P.B. Bendix -- The application of computers to research in non-associative algebras / L.J. Paige -- Identities in Jordan algebras / C.M. Glennie -- On a property D neofields and some problems concerning orthogonal latin squares / A.D. Keedwell -- A projective configuration / J.W.P. Hirschfeld -- The uses of computers in Galois theory / W.D. Maurer -- An enumeration of knots and links, and some of their algebraic properties / J.H. Conway -- Computations in knot theory / H.F. Trotter -- Computer experiments on sequences which form integral bases / S. Lin -- Application of computer to algebraic topology on some bicomplex manifolds / H. Cohn -- A real root calculus / H. Zassenhaus -- Some computational problems and methods related to invariant factors and control theory / R.E. Kalman.
Edited by John Leech. With a foreword by J. Howlett.
Papers based on lectures presented at a conference held at Oxford under the auspices of the Science Research Council, Atlas Computer Laboratory, Aug. 29-Sept. 2, 1967.
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. http://purl.oclc.org/DLF/benchrepro0212 MiAaHDL
digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL