Softcover ISBN:  9780821832516 
Product Code:  CBMS/97 
List Price:  $43.00 
Individual Price:  $34.40 
Electronic ISBN:  9781470424572 
Product Code:  CBMS/97.E 
List Price:  $40.00 
Individual Price:  $32.00 

Book DetailsCBMS Regional Conference Series in MathematicsVolume: 97; 2002; 152 ppMSC: Primary 13; 14; 65; Secondary 12; 35; 52; 62; 68; 90; 91;
A classic problem in mathematics is solving systems of polynomial equations in several unknowns. Today, polynomial models are ubiquitous and widely used across the sciences. They arise in robotics, coding theory, optimization, mathematical biology, computer vision, game theory, statistics, and numerous other areas.
This book furnishes a bridge across mathematical disciplines and exposes many facets of systems of polynomial equations. It covers a wide spectrum of mathematical techniques and algorithms, both symbolic and numerical.
The set of solutions to a system of polynomial equations is an algebraic variety—the basic object of algebraic geometry. The algorithmic study of algebraic varieties is the central theme of computational algebraic geometry. Exciting recent developments in computer software for geometric calculations have revolutionized the field. Formerly inaccessible problems are now tractable, providing fertile ground for experimentation and conjecture.
The first half of the book gives a snapshot of the state of the art of the topic. Familiar themes are covered in the first five chapters, including polynomials in one variable, Gröbner bases of zerodimensional ideals, Newton polytopes and Bernstein's Theorem, multidimensional resultants, and primary decomposition.
The second half of the book explores polynomial equations from a variety of novel and unexpected angles. It introduces interdisciplinary connections, discusses highlights of current research, and outlines possible future algorithms. Topics include computation of Nash equilibria in game theory, semidefinite programming and the real Nullstellensatz, the algebraic geometry of statistical models, the piecewiselinear geometry of valuations and amoebas, and the EhrenpreisPalamodov theorem on linear partial differential equations with constant coefficients.
Throughout the text, there are many handson examples and exercises, including short but complete sessions in Maple®, MATLAB®, Macaulay 2, Singular, PHCpack, CoCoA, and SOSTools software. These examples will be particularly useful for readers with no background in algebraic geometry or commutative algebra. Within minutes, readers can learn how to type in polynomial equations and actually see some meaningful results on their computer screens.
Prerequisites include basic abstract and computational algebra. The book is designed as a text for a graduate course in computational algebra.ReadershipGraduate students and research mathematicians interested in computational algebra and its applications.

Table of Contents

Chapters

Chapter 1. Polynomials in one variable

Chapter 2. Gröbner bases of zerodimensional ideals

Chapter 3. Bernstein’s theorem and fewnomials

Chapter 4. Resultants

Chapter 5. Primary decomposition

Chapter 6. Polynomial systems in economics

Chapter 7. Sums of squares

Chapter 8. Polynomial systems in statistics

Chapter 9. Tropical algebraic geometry

Chapter 10. Linear partial differential equations with constant coefficients


Additional Material

Reviews

Methods for solving systems of polynomial equations in the tropical semiring promise to have wideranging applications and have not been treated in monograph before. The book is written in an lively style with many examples, comments, computer algebra sessions and a generous dose of tempting exercises. It can be read with a reasonably good knowledge of basic algebra and is well suited for a lecture course on the graduate level. For the researcher who wants to get an accessible introduction to current techniques in polynomial system solving it can be highly recommended.
Zentralblatt Math


RequestsReview Copy – for reviewers who would like to review an AMS bookAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Additional Material
 Reviews
 Requests
A classic problem in mathematics is solving systems of polynomial equations in several unknowns. Today, polynomial models are ubiquitous and widely used across the sciences. They arise in robotics, coding theory, optimization, mathematical biology, computer vision, game theory, statistics, and numerous other areas.
This book furnishes a bridge across mathematical disciplines and exposes many facets of systems of polynomial equations. It covers a wide spectrum of mathematical techniques and algorithms, both symbolic and numerical.
The set of solutions to a system of polynomial equations is an algebraic variety—the basic object of algebraic geometry. The algorithmic study of algebraic varieties is the central theme of computational algebraic geometry. Exciting recent developments in computer software for geometric calculations have revolutionized the field. Formerly inaccessible problems are now tractable, providing fertile ground for experimentation and conjecture.
The first half of the book gives a snapshot of the state of the art of the topic. Familiar themes are covered in the first five chapters, including polynomials in one variable, Gröbner bases of zerodimensional ideals, Newton polytopes and Bernstein's Theorem, multidimensional resultants, and primary decomposition.
The second half of the book explores polynomial equations from a variety of novel and unexpected angles. It introduces interdisciplinary connections, discusses highlights of current research, and outlines possible future algorithms. Topics include computation of Nash equilibria in game theory, semidefinite programming and the real Nullstellensatz, the algebraic geometry of statistical models, the piecewiselinear geometry of valuations and amoebas, and the EhrenpreisPalamodov theorem on linear partial differential equations with constant coefficients.
Throughout the text, there are many handson examples and exercises, including short but complete sessions in Maple®, MATLAB®, Macaulay 2, Singular, PHCpack, CoCoA, and SOSTools software. These examples will be particularly useful for readers with no background in algebraic geometry or commutative algebra. Within minutes, readers can learn how to type in polynomial equations and actually see some meaningful results on their computer screens.
Prerequisites include basic abstract and computational algebra. The book is designed as a text for a graduate course in computational algebra.
Graduate students and research mathematicians interested in computational algebra and its applications.

Chapters

Chapter 1. Polynomials in one variable

Chapter 2. Gröbner bases of zerodimensional ideals

Chapter 3. Bernstein’s theorem and fewnomials

Chapter 4. Resultants

Chapter 5. Primary decomposition

Chapter 6. Polynomial systems in economics

Chapter 7. Sums of squares

Chapter 8. Polynomial systems in statistics

Chapter 9. Tropical algebraic geometry

Chapter 10. Linear partial differential equations with constant coefficients

Methods for solving systems of polynomial equations in the tropical semiring promise to have wideranging applications and have not been treated in monograph before. The book is written in an lively style with many examples, comments, computer algebra sessions and a generous dose of tempting exercises. It can be read with a reasonably good knowledge of basic algebra and is well suited for a lecture course on the graduate level. For the researcher who wants to get an accessible introduction to current techniques in polynomial system solving it can be highly recommended.
Zentralblatt Math