Handbook of Computational Group Theory

AvDerek F. Holt,Bettina Eick

E-bok

Engelska, 2005

Del i serien Discrete Mathematics and Its Applications

828 kr

Läs direkt i Bokus Reader – eller ladda ned till din enhet

Fler format och utgåvor

Häftad

715 kr

E-bok

828 kr

Inbunden

2 366 kr

Beskrivning

The origins of computation group theory (CGT) date back to the late 19th and early 20th centuries. Since then, the field has flourished, particularly during the past 30 to 40 years, and today it remains a lively and active branch of mathematics.The Handbook of Computational Group Theory offers the first complete treatment of all the fundame

Produktinformation

Utgivningsdatum:2005-01-13
Språk:Engelska
Filformat:EPUB
Kopieringsskydd:LCP
ISBN:9781040069172
Förlag:Taylor & Francis Ltd
Serie:Discrete Mathematics and Its Applications

Utforska kategorier

Mer om författaren

Derek F. Holt, Bettina Eick, Eamonn A. O'Brien

Recensioner i media

"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

Innehållsförteckning

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)