Gröbner Bases: A Computational Approach to Commutative Algebra

Gröbner Bases: A Computational Approach to Commutative Algebra

by Thomas Becker, Volker Weispfenning, H. Kredel
     
 

This book provides a comprehensive treatment of Gr bner bases theory embedded in an introduction to commutative algebra from a computational point of view. The centerpiece of Gr bner bases theory is the Buchberger algorithm, which provides a common generalization of the Euclidean algorithm and the Gaussian elimination algorithm to multivariate polynomial rings. The

Overview

This book provides a comprehensive treatment of Gr bner bases theory embedded in an introduction to commutative algebra from a computational point of view. The centerpiece of Gr bner bases theory is the Buchberger algorithm, which provides a common generalization of the Euclidean algorithm and the Gaussian elimination algorithm to multivariate polynomial rings. The book explains how the Buchberger algorithm and the theory surrounding it are eminently important both for the mathematical theory and for computational applications. A number of results such as optimized version of the Buchberger algorithm are presented in textbook format for the first time. This book requires no prerequisites other than the mathematical maturity of an advanced undergraduate and is therefore well suited for use as a textbook. At the same time, the comprehensive treatment makes it a valuable source of reference on Gr bner bases theory for mathematicians, computer scientists, and others. Placing a strong emphasis on algorithms and their verification, while making no sacrifices in mathematical rigor, the book spans a bridge between mathematics and computer science.

Editorial Reviews

Booknews
The centerpiece of Grobner basis theory is the Buchberger algorithm, the importance of which is explained, as it spans mathematical theory and computational applications. This comprehensive treatment is useful as a text and as a reference for mathematicians and computer scientists and requires no prerequisites other than the mathematical maturity of an advanced undergraduate. Strong emphasis is placed on algorithms and their verification, with no sacrifices in mathematical rigor. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Product Details

ISBN-13:
9781461269441
Publisher:
Springer New York
Publication date:
12/31/2012
Series:
Graduate Texts in Mathematics Series, #141
Edition description:
Softcover reprint of the original 1st ed. 1993
Pages:
576
Product dimensions:
6.14(w) x 9.21(h) x 1.22(d)

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >