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 - Couverture souple
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Présentation de l'éditeur
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Autres éditions populaires du même titre
Résultats de recherche pour Computational Problems in Abstract Algebra: Proceedings...
Image d'archives
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
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Brand New. 412 pages. 9.25x6.25x0.93 inches. In Stock. N° de réf. du vendeur zk1483127001
Acheter neuf
EUR 99,74
Frais de port :
EUR 14,21
De Royaume-Uni vers Etats-Unis
Quantité disponible : 1 disponible(s)