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.

"The power of general purpose computational algebra systems running on personal computers has increased rapidly in recent years. For mathematicians doing research in group theory, this means a growing set of sophisticated computational tools are now available for their use in developing new theoretical results." "This volume consists of contributions by researchers invited to the AMS Special Session on Computational Group Theory held in March 2007. The main focus of the session was on the application of Computational Group Theory (CGT) to a wide range of theoretical aspects of group theory. The articles in this volume provide a variety of examples of how these computer systems helped to solve interesting theoretical problems within the discipline, such as constructions of finite simple groups, classification of $p$-groups via coclass, representation theory and constructions involving free nilpotent groups. The volume also includes an article by R. F. Morse highlighting applications of CGT in group theory and two survey articles." "Graduate students and researchers interested in various aspects of group theory will find many examples of Computational Group Theory helping research and will recognize it as yet another tool at their disposal."--BOOK JACKET.

The workshop "Groups and Computations" took place at the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) at Rutgers University in June 1995. This and an earlier workshop held in October 1991 was aimed at merging theory and practice within the broad area of computation with groups. The primary goal of the previous workshop was to foster a dialogue between researchers studying the computational complexity of group algorithms and those engaged in the development of practical software. It was expected that this would lead to a deeper understanding of the mathematical issues underlying group computation and that this understanding would lead, in turn, to faster algorithms. Comments and subsequent work indicated that this goal had been achieved beyond expectations. The second workshop was designed to reinforce the progress in these directions. The scientific program consisted of invited lectures and research announcements, as well as informal discussions and software demonstrations. The eight extended talks discussed randomization, permutation groups, matrix groups, software systems, fast Fourier transforms and their applications to signal processing and data analysis, computations with finitely presented groups, and implementation and complexity questions. As in the previous workshop, speakers ranged from established researchers to graduate students.

This Handbook gives a comprehensive snapshot of a field at the intersection of mathematics and computer science with applications in physics, engineering and education. Reviews 67 software systems and offers 100 pages on applications in physics, mathematics, computer science, engineering chemistry and education.

This is the third volume of a comprehensive and elementary treatment of finite p-group theory. Topics covered in this volume: impact of minimal nonabelian subgroups on the structure of p-groups, classification of groups all of whose nonnormal subgroups have the same order, degrees of irreducible characters of p-groups associated with finite algebras, groups covered by few proper subgroups, p-groups of element breadth 2 and subgroup breadth 1, exact number of subgroups of given order in a metacyclic p-group, soft subgroups, p-groups with a maximal elementary abelian subgroup of order p2, p-groups generated by certain minimal nonabelian subgroups, p-groups in which certain nonabelian subgroups are 2-generator. The book contains many dozens of original exercises (with difficult exercises being solved) and a list of about 900 research problems and themes.

From experimental design to cryptography, this comprehensive, easy-to-access reference contains literally all the facts you need on combinatorial designs. It includes constructions of designs, existence results, and properties of designs. Organized into six main parts, the CRC Handbook of Combinatorial Designs covers:

Selected papers from 'Groups St Andrews 2005' cover a wide spectrum of modern group theory.

This two-volume book contains selected papers from the international conference 'Groups 1993 Galway / St Andrews' which was held at University College Galway in August 1993. The wealth and diversity of group theory is represented in these two volumes. As with the Proceedings of the earlier 'Groups-St Andrews' conferences it is hoped that the articles in these Proceedings will, with their many references, prove valuable both to experienced researchers and also to new postgraduates interested in group theory.

Research in computational group theory, an active subfield of computational algebra, has emphasised three areas: finite permutation groups, finite solvable groups, and finitely presented groups. This book deals with the third of these areas. The author emphasises the connections with fundamental algorithms from theoretical computer science, particularly the theory of automata and formal languages, computational number theory, and computational commutative algebra. The LLL lattice reduction algorithm and various algorithms for Hermite and Smith normal forms from computational number theory are used to study the abelian quotients of a finitely presented group. The work of Baumslag, Cannonito and Miller on computing nonabelian polycyclic quotients is described as a generalisation of Buchberger's Gröbner basis methods to right ideals in the integral group ring of a polycyclic group. Researchers in computational group theory, mathematicians interested in finitely presented groups and theoretical computer scientists will find this book useful.