Synopses & Reviews
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.
Synopsis
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 Grbner 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 Grbner 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.
Synopsis
The discovery of new algorithms for dealing with polynomial equations, and their implementation on fast, inexpensive computers, has revolutionized algebraic geometry and led to exciting new applications in the field. This book details many uses of algebraic geometry and highlights recent applications of Grobner bases and resultants. This edition contains two new sections, a new chapter, updated references and many minor improvements throughout.
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.