Available:*
Library | Item Barcode | Call Number | Material Type | Item Category 1 | Status |
---|---|---|---|---|---|
Searching... | 30000004589333 | QA564 C69 2005 | Open Access Book | Book | Searching... |
On Order
Summary
Summary
In recent years, the discovery of new algorithms for dealing with polynomial equations, coupled with their implementation on fast inexpensive computers, has sparked a minor revolution in the study and practice of algebraic geometry. These algorithmic methods have also given rise to some exciting new applications of algebraic geometry. This book illustrates the many uses of algebraic geometry, highlighting some of the more recent applications of Gröbner bases and resultants. In order to do this, the authors provide an introduction to some algebraic objects and techniques which are more advanced than one typically encounters in a first course, but nonetheless of great utility. The book is written for nonspecialists and for readers with a diverse range of backgrounds. It assumes knowledge of the material covered in a standard undergraduate course in abstract algebra, and it would help to have some previous exposure to Gröbner bases. The book does not assume the reader is familiar with more advanced concepts such as modules. For this new edition the authors added two new sections and a new chapter, updated the references and made numerous minor improvements throughout the text.
Table of Contents
Introduction |
Solving Polynomial Equations |
Resultants |
Computation in Local Rings |
Modules |
Free Resolutions |
Polytopes, Resultants and Equations |
Integer Programming, Combinatorics and Splines |
Algebraic Coding Theory |
The Berlekamp-Massey-Sakata Decoding Algorithm |