This monograph addresses the problem of describing all primitive soluble permutation groups of a given degree, with particular reference to those degrees less than 256. The theory is presented in detail and in a new way using modern terminology. A description is obtained for the primitive soluble permutation groups of prime-squared degree and a partial description obtained for prime-cubed degree. These descriptions are easily converted to algorithms for enumerating appropriate representatives of the groups. The descriptions for degrees 34 (die vier hochgestellt, Sonderzeichen) and 26 (die sechs hochgestellt, Sonderzeichen) are obtained partly by theory and partly by machine, using the software system Cayley. The material is appropriate for people interested in soluble groups who also have some familiarity with the basic techniques of representation theory. This work complements the substantial work already done on insoluble primitive permutation groups.

This volume consists of contributions by researchers who were invited to the Harlaxton Conference on Computational Group Theory and Cohomology, held in August of 2008, and to the AMS Special Session on Computational Group Theory, held in October 2008. This volume showcases examples of how Computational Group Theory can be applied to a wide range of theoretical aspects of group theory. Among the problems studied in this book are classification of p-groups, covers of Lie groups, resolutions of Bieberbach groups, and the study of the lower central series of free groups. This volume also includes expository articles on the probabilistic zeta function of a group and on enumerating subgroups of symmetric groups. Researchers and graduate students working in all areas of Group Theory will find many examples of how Computational Group Theory helps at various stages of the research process, from developing conjectures through the verification stage. These examples will suggest to the mathematician ways to incorporate Computational Group Theory into their own research endeavors.

These nine articles provide up-to-date surveys of topics of contemporary interest in combinatorics.

Based on the ontology and semantics of algebra, the computer algebra system Magma enables users to rapidly formulate and perform calculations in abstract parts of mathematics. Edited by the principal designers of the program, this book explores Magma. Coverage ranges from number theory and algebraic geometry, through representation theory and group theory to discrete mathematics and graph theory. Includes case studies describing computations underpinning new theoretical results.

Following the basic ideas, standard constructions and important examples in the theory of permutation groups, the book goes on to develop the combinatorial and group theoretic structure of primitive groups leading to the proof of the pivotal ONan-Scott Theorem which links finite primitive groups with finite simple groups. Special topics covered include the Mathieu groups, multiply transitive groups, and recent work on the subgroups of the infinite symmetric groups. With its many exercises and detailed references to the current literature, this text can serve as an introduction to permutation groups in a course at the graduate or advanced undergraduate level, as well as for self-study.

This book summarizes recent developments in the study of permutation groups for beginning graduate students.