Computational Problems in Abstract Algebra (PDF)
Proceedings of a Conference Held at Oxford Under the Auspices of the Science Research Council Atlas Computer Laboratory, 29th August to 2nd September 1967
(Sprache: Englisch)
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...
sofort als Download lieferbar
eBook (pdf)
54.95 €
27 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „Computational Problems in Abstract Algebra (PDF)“
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.
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.
Bibliographische Angaben
- 2014, 412 Seiten, Englisch
- Herausgegeben: John Leech
- Verlag: Elsevier Science & Techn.
- ISBN-10: 1483159426
- ISBN-13: 9781483159423
- Erscheinungsdatum: 17.05.2014
Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: PDF
- Größe: 40 MB
- Mit Kopierschutz
- Vorlesefunktion
Sprache:
Englisch
Kopierschutz
Dieses eBook können Sie uneingeschränkt auf allen Geräten der tolino Familie lesen. Zum Lesen auf sonstigen eReadern und am PC benötigen Sie eine Adobe ID.
Kommentar zu "Computational Problems in Abstract Algebra"
0 Gebrauchte Artikel zu „Computational Problems in Abstract Algebra“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Computational Problems in Abstract Algebra".
Kommentar verfassen