Gröbner Basis and Its Applications
Computer Algebra is a field of mathematics and computer science that studies algorithms for symbolic computation. A fundamental tool in computer algebra to study polynomial ideals is the theory of Geöbner basis. The notion of the Gröbner basis and the Buchberger’s algorithm for computing it was proposed by Bruno Buchberger in 1965. Gröbner bases have numerous applications in commutative algebra, algebraic geometry, combinatorics, coding theory, cryptography, theorem proving, etc. The Buchberger’s algorithm is implemented in many computer algebra systems, such as Risa/Asir, Macaulay2, Singular, CoCoa, Maple, and Mathematica. In this chapter, we will give a short introduction on Gröbner basis theory, and then we will present some applications of Gröbner bases.
KeywordsGröbner basis Toric ideal
- 2.P. Conti, C. Traverso, Buchberger algorithm and integer programming, in Proceedings of the AAECC-9. LNCS, vol. 539 (Springer, New Orleans, 1991), pp. 130–139Google Scholar
- 6.D. Eisenbud, Commutative Algebra with a View Toward Algebraic Geometry (Springer, Berlin, 1995)Google Scholar
- 7.B. Sturmfels, Gröbner Bases and Convex Polytopes, (Lectures Series), vol. 8, (American Mathematics Society, Providence, 1996)Google Scholar