As the primary tool for doing explicit computations in polynomial rings in many variables, Gröbner bases are an important component of all computer algebra systems. They are also important in computational commutative algebra and algebraic geometry. This book provides a leisurely and fairly comprehensive introduction to Gröbner bases and their applications. Adams and Loustaunau cover the following topics: the theory and construction of Gröbner bases for polynomials with coefficients in a field, applications of Gröbner bases to computational problems involving rings of polynomials in many variables, a method for computing syzygy modules and Gröbner bases in modules, and the theory of Gröbner bases for polynomials with coefficients in rings. With over 120 worked out examples and 200 exercises, this book is aimed at advanced undergraduate and graduate students. It would be suitable as a supplement to a course in commutative algebra or as a textbook for a course in computer algebra or computational commutative algebra. This book would also be appropriate for students of computer science and engineering who have some acquaintance with modern algebra.
* Basic theory of Gröbner bases * Applications of Gröbner bases * Modules and Gröbner bases * Gröbner bases over rings * Appendix A. Computations and algorithms * Appendix B. Well-ordering and induction * References * List of symbols * Index