Contact us Heritage collections Image license terms
HOME ACL Associates Technology Literature Applications Society Software revisited
Further reading □ Overview □ Use of Atlas in the discovery of a theorem □ Computing, partitions and Thirteen □ Feasible computability □ Conjecture related to Riemann hypothesis □ Computing with character tables of finite groups □ Computable error bounds □ Destructive and constructive computing □ New theorem in additive theory □ Combinatorial problems □ Classifying elements in a set of properties □ Symposia □ Computational problems in abstract algebra (1967) □ Computers in number theory (1969)
ACD C&A INF CCD CISD Archives Contact us Heritage archives Image license terms

Search

   
⟶ ACL ⟶ Applications ⟶ Mathematics :: Mathematics
⟶ ACL ⟶ Applications ⟶ Mathematics :: Mathematics
ACL ACD C&A INF CCD CISD Archives
Further reading ⇓

□ Overview
□ Use of Atlas in the discovery of a theorem
□ Computing, partitions and Thirteen
□ Feasible computability
□ Conjecture related to Riemann hypothesis
□ Computing with character tables of finite groups
□ Computable error bounds
□ Destructive and constructive computing
□ New theorem in additive theory
□ Combinatorial problems
□ Classifying elements in a set of properties
Symposia
□ Computational problems in abstract algebra (1967)
□ Computers in number theory (1969)

Computational Problems in Abstract Algebra

J Leech

29 August - 2 September, 1967

The Conference took place in Oxford. John Leech of the University of Glasgow took a Research Fellowship at the Atlas Computer Laboratory to supervise the production of the Conference Proceedings. This was the first of a number of Symposia organised by the Laboratory.

The speakers were as follows:

Joachim Neubuser Investigations of groups on computers 1 Kiel Univ
John Leech Coset enumeration 21 Glasgow Univ
Colin M Campbell Some examples using coset enumeration 37 St Andrews Univ
Nathan S Mendelsohn Defining relations for subgroups of finite index of groups with a finite presentation 43 Kiel Univ
Martin J Dunwoody Nielsen transformations 45 Univ Sussex
Helmut Jurgensen Calculation with the elements of a finite group given by generators and defining relations 47 Kiel Univ
Volkmar Felsch and Joachim Neubuser On a programme for the determination of the automorphism group of a finite group 59 Kiel Univ
Leonhard Gerhards and Ekkehard Altmann A computational method for determining the automorphism group of a finite solvable group 61 Bonn Univ
Wolfgang Lindenberg and Leonhard Gerhards Combinatorial construction by computer of the set of all subgroups of a finite group by composition of partial sets of its subgroups 75 Bonn Univ
K Ferber and Helmut Jurgensen A programme for the drawing of lattices 83 Kiel Univ
John McKay The construction of the character table of a finite group from generators and relations 89 ACL
C Brott and Joachim Neubuser A programme for the calculation of characters and representations of finite groups 101 Kiel Univ
J Sutherland Frame The characters of the Weyl group Es 111 Michigan State Univ
R Bulow and Joachim Neubuser On some applications of group-theoretical programmes to the derivation of the crystal classes of R4 131 Kiel Univ
Marshall Hall Jr A search for simple groups of order less than one million 137 California Institute of Technology
Charles C Sims Computational methods in the study of permutation groups 169 Rutgers Univ
E Krause and K Weston An algorithm related to the restricted Burnside group of prime exponent 185 Michigan Univ
Alan L Tritter A module-theoretic computation related to the Burnside problem 189 Oxford Univ
John J Cannon Some combinatorial and symbol manipulation programs in group theory 199 Univ of Sydney
P G Ruud and R Keown The computation of irreducible representations of finite groups of order 2n, n ≤ 6 205 Texas A&M and Univ of Arkansas
Nathan S Mendelsohn Some examples of man-machine interaction in the solution of mathematical problems 217 Kiel Univ
Robert J Plemmons Construction and analysis of non-equivalent finite semigroups 223 Univ of Tennessee
Takayuki Tamura Some contributions of computation to semigroups and groupoids 229 Univ of California, Davis
Donald E Knuth and Peter B Bendix Simple word problems in universal algebras 263 California Institute of Technology
Lowell J Paige The application of computers to research in non-associative algebras 299 Univ of California, Los Angeles
Charles M Glennie Identities in Jordan algebras 307 Home Office Statistical Branch
A Donald Keedwell On property D neofields and some problems concerning orthogonal latin squares 315 Surrey Univ
James William Peter Hirschfeld A projective configuration 321 Sussex Univ
Ward Douglas Maurer The uses of computers in Galois theory 325 Univ of California, Berkeley
Jon Horton Conway An enumeration of knots and links, and some of their algebraic properties 329 Cambridge Univ
Hale Freeman Trotter Computations in knot theory 359 Princeton Univ
Shen Lin Computer experiments on sequences which form integral bases 365 Bell Labs
Harvey Cohn Application of computer to algebraic topology on some bicomplex manifolds 371 Univ of Arizona
Hans Zassenhaus A real root calculus 383 Univ of Ohio
Rudolf Emil Kalman Some computational problems and methods related to invariant factors and control theory 393 Stanford Univ
List of participants 399
⇑ Top of page
© Chilton Computing and UKRI Science and Technology Facilities Council webmaster@chilton-computing.org.uk
Our thanks to UKRI Science and Technology Facilities Council for hosting this site