1992 | OriginalPaper | Buchkapitel
Groebner Bases
verfasst von : David Cox, John Little, Donal O’Shea
Erschienen in: Ideals, Varieties, and Algorithms
Verlag: Springer New York
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In Chapter 1, we have seen how the algebra of the polynomial rings k[x1,…, 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 ideals 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.