Ideals, Varieties, and Algorithms pp 47-111 | Cite as

# Groebner Bases

## Abstract

In Chapter 1, we have seen how the algebra of the polynomial rings *k*[*x* _{ l },..., *x* _{ n }] and the geometry of affine algebraic varieties are linked. In this chapter, we will study the method of Groebner bases, which will allow us to solve problems about polynomial ideals in an algorithmic or computational fashion. The method of Groebner bases is also used in several powerful computer algebra systems to study specific polynomial ideas that arise in applications. In Chapter 1, we posed many problems concerning the algebra of polynomial ideals and the geometry of affine varieties. In this chapter and the next, we will focus on four of these problems.

## Keywords

Computer Algebra System Polynomial Ideal Monomial Ideal Division Algorithm Affine Variety## Preview

Unable to display preview. Download preview PDF.