Read more
Zusatztext "This is a book I am very happy to have! both for the choice of content and the quality of exposition. Its subject is a very complete and up-to-date review of computational group theory. ?All together! the book contains of a huge amount of information. ?I think every mathematician will want this book on his shelf."-Mathematics of Computation"It will be an indispensable source for any user in this field." - G. Kowol! in Monatshefte fur Math! 2007! Vol. 151! No. 3 Informationen zum Autor Derek F. Holt, Bettina Eick, Eamonn A. O'Brien Klappentext This handbook covers the whole subject of computational group theory (CGT) at a level suitable for beginning graduate students who have some knowledge of group theory and computer algorithms. It develops the theory of algorithms in full detail! includes complexity analyses whenever possible! and highlights the connections between the different aspects of CGT and other areas of computer algebra. Several specialist sections provide pointers to the current state of the art in these areas! and all sections include exercises of varying difficulty. For each major collection of algorithms! the book includes a section describing applications both within and outside of group theory. Zusammenfassung Covers the subject of computational group theory (CGT). This book describes the connections between the different aspects of CGT and other areas of computer algebra. It is suitable for graduate students who have some knowledge of group theory and computer algorithms. Inhaltsverzeichnis Group Theoretical Preliminaries. History of Computational Group Theory (CGT) and Its Place Within Computational Algebra. Methods of Representing Groups on a Computer. Base and Strong Generating Set Methods in Finite Permutation and Matrix Groups. Coset Enumeration. Computation in Finite Nilpotent and Solvable Groups. Representation Theory, Character Theory, and Cohomology. Algorithms Based on the Normal Structure of Finite Groups. Libraries and Databases of Groups. The Matrix Group Recognition Project. Special Techniques for Computing with Very Large Groups and Their Representations. Quotient Algorithms for Finitely Presented Groups. Rewriting Systems and the Knuth-Bendix Completion Process. Automatic Groups (Methods Involving Finite State Automata)...
