Gröbner Bases: A Computational Approach to Commutative Algebra

✍ Scribed by Thomas Becker, Volker Weispfenning, H. Kredel

• Publisher: Springer
• Year: 1998
• Tongue: English
• Leaves: 298
• Series: Graduate Texts in Mathematics) (v. 141
• Edition: Corrected
• Category: Library

✦ Synopsis

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.