Téléchargez le livre :  Computational Problems in Abstract Algebra

Computational Problems in Abstract Algebra

Proceedings of a Conference Held at Oxford Under the Auspices of the Science Research Council Atlas Computer Laboratory, 29th August to 2nd September 1967

de

Éditeur :

Pergamon


Paru le : 2014-05-17



eBook Téléchargement ebook sans DRM
57,97

Téléchargement immédiat
Dès validation de votre commande
Ajouter à ma liste d'envies
Image Louise Reader présentation

Louise Reader

Lisez ce titre sur l'application Louise Reader.

Description
Computational Problems in Abstract Algebra provides information pertinent to the application of computers to abstract algebra. This book discusses combinatorial problems dealing with things like generation of permutations, projective planes, orthogonal latin squares, graphs, difference sets, block designs, and Hadamard matrices. Comprised of 35 chapters, this book begins with an overview of the methods utilized in and results obtained by programs for the investigation of groups. This text then examines the method for establishing the order of a finite group defined by a set of relations satisfied by its generators. Other chapters describe the modification of the Todd–Coxeter coset enumeration process. This book discusses as well the difficulties that arise with multiplication and inverting programs, and of some ways to avoid or overcome them. The final chapter deals with the computational problems related to invariant factors in linear algebra. Mathematicians as well as students of algebra will find this book useful.
Pages
412 pages
Collection
n.c
Parution
2014-05-17
Marque
Pergamon
EAN papier
9780080129754
EAN PDF SANS DRM
9781483159423

Prix
57,97 €

Suggestions personnalisées