Handbook of computational group theory / Derek F. Holt, Bettina Eick and Eamonn a. O'Brien
Language: English Publication details: Boca Raton : CRC Press, 2023.Description: xvi, 514 p. : ill. ; 24 cmISBN:- 9781498797887
- 511.352 HOL
Item type | Current library | Shelving location | Call number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|---|
Books | Gulbanoo Premji Library, Azim Premji University, Bengaluru | 2nd Floor | 511.352 HOL (Browse shelf(Opens below)) | Available | 51838 |
Browsing Gulbanoo Premji Library, Azim Premji University, Bengaluru shelves, Shelving location: 2nd Floor Close shelf browser (Hides shelf browser)
511.35 MAR Introduction to languages and the theory of computation / | 511.35 SIP Introduction to the theory of computation / | 511.35 SIP Introduction to the theory of computation / | 511.352 HOL Handbook of computational group theory / | 511.36 HAM Proof and the art of mathematics / | 511.36071 HAN Proof and proving in mathematics education : | 511.36071 STY Teaching and learning proof across the grades : |
Includes index.
Includes bibliographical references.
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)
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 aspe...
There are no comments on this title.