Abstract
The purpose of Chapter 1 is to provide the reader with sufficient knowledge of the basic theory of Gröbner bases which is required for reading the later chapters. In Section 1.1, we study Dickson’s Lemma, which is a classical result in combinatorics. Gröbner bases are then introduced and Hilbert’s Basis Theorem and Macaulay’s Theorem follow. In Section 1.2, the division algorithm, which is the framework of Gröbner bases, is discussed with a focus on the importance of the remainder when performing division. The highlights of the fundamental theory of Gröbner bases are Buchberger’s criterion and Buchberger’s algorithm presented in Section 1.3. Furthermore, in Section 1.4, elimination theory will be introduced. This theory is very useful for solving a system of polynomial equations. Finally, in Section 1.5, we discuss the universal Gröbner basis of an ideal. This is a finite set of polynomials which is a Gröbner basis for the ideal with respect to any monomial order.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Adams, W.W., Loustaunau, P.: An Introduction to Gröbner Bases. Graduate Studies in Mathematics, vol. 3. American Mathematical Society, Providence (1994)
Bayer, D., Morrison, I.: Gröbner bases and geometric invariant theory I. J. Symb. Comput. 6, 209–217 (1988)
Becker, T., Weispfenning V.: Gröbner Bases. Springer, New York (1993)
Buchberger, B.: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Ph.D. Dissertation, University of Innsbruck (1965)
Cox, D.A., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms. Springer, New York (1992)
Hibi, T. (ed.): Gröbner Bases: Statistics and Software Systems. Springer, Berlin (2013)
Hironaka, H.: Resolution of singularities of an algebraic variety over a field of characteristic zero. Ann. Math. 79, 109–203, 205–326 (1964)
Mora, T., Robbiano, L.: The Gröbner fan of an ideal. J. Symb. Comput. 6, 183–208 (1988)
Sturmfels, B., Thomas, R.R.: Variation of cost functions in integer programming. Math. Program. 77, 357–387 (1997)
Sturmfels, B., Weismantel, R., Ziegler, G.M.: Gröbner bases of lattices corner polyhedra and integer programming. Beiträge zur Geometrie und Algebra 36, 281–298 (1995)
Weispfenning, V.: Constructing universal Gröbner bases. In: Huguet, L., Poli, A. (eds.) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Lecture Notes in Computer Science, vol. 356, pp. 408–417. Springer, Berlin (1987)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Herzog, J., Hibi, T., Ohsugi, H. (2018). Polynomial Rings and Gröbner Bases. In: Binomial Ideals. Graduate Texts in Mathematics, vol 279. Springer, Cham. https://doi.org/10.1007/978-3-319-95349-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-95349-6_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-95347-2
Online ISBN: 978-3-319-95349-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)