Abstract
In Chapter 1, we have seen how the algebra of the polynomial rings k[x 1,..., 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 aIgorithmic 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Cox, D., Little, J., O’Shea, D. (1997). Groebner Bases. In: Ideals, Varieties, and Algorithms. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-2693-0_2
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2693-0_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-2695-4
Online ISBN: 978-1-4757-2693-0
eBook Packages: Springer Book Archive