Notes on Gröbner bases
type: Item
instance of: scholarly article
title: Notes on Gröbner bases
zbMATH Open document ID: 0686.13005
DOI: 10.1016/0020-0255(89)90037-6
author: K. Appert
published in: Information Sciences
publication date: 1989-01-01T00:00:00Z
review text: A self-contained exposition of the theory of Gröbner bases and its applications, mainly based on work of Buchberger. A Gröbner basis is a basis for an ideal with properties that allow a lot of computational problems to be solved that involve ideals. The authors advocates the constructive point of view within algebraic geometry. They remark that algorithmic algebraic geometry involves the search for a variety of bounds. The authors first recall the basic facts needed from polynomial and ideal theory, then they present the definition of a Gröbner basis using normal forms. In subsequent sections, the normal form algorithm is presented, together with results on bounds for normal form algorithms. Next, they present some alternative definitions of Gröbner bases (e.g. using Church-Rosser relations, \(NF_ G(f)\) and \(NF_ G(S(f,g)))\). The authors also present the basic algorithm of Buchberger which transforms a finite set of polynomials into a Gröbner basis. This algorithm is simple but nondeterministic as it calls the normal form algorithms. Gröbner bases can in addition be turned into a unique object if one restricts oneself to reduced Gröbner bases. Moreover, reduced Gröbner bases can be determined in an algorithmic way. Finally a few applications are presented: algorithms to reduce modulo an ideal, to test membership of an ideal, to test congruence modulo an ideal and to test whether two ideal are equal or contained in each other. There are also some applications in residue class ring theory and the theory of solving systems of polynomial equations.
Mathematics Subject Classification ID: 13F20
Mathematics Subject Classification ID: 14A05
Mathematics Subject Classification ID: 14-04
Mathematics Subject Classification ID: 13-04
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 4123853
zbMATH Keywords: computational algebraic geometry
zbMATH Keywords: standard basis
zbMATH Keywords: reduced Gröbner bases
MaRDI profile type: Publication
full work available at URL: 0020-0255(89)90037-6
OpenAlex ID: W4229571709
cites work: Historical Ramblings in Algebraic Geometry and Related Algebra
cites work: A simplified proof of the characterization theorem for Gröbner-bases
cites work: Comments on the translation of my PhD thesis: ``An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal''
cites work: Q3714165
cites work: Q3325832
cites work: Q3750117
cites work: Q3765889
cites work: Resolution of singularities of an algebraic variety over a field of characteristic zero. I
cites work: The complexity of the word problems for commutative semigroups and polynomial ideals
cites work: Q3678669
cites work: Constructive Aspects of Noetherian Rings
cites work: Q3708893
cites work: On the theory of graded structures
cites work: On the Length of a Hilbert Ascending Chain
cites work: Constructive Proof of Hilbert's Theorem on Ascending Chains
cites work: Constructions in Algebra
cites work: Q3703294
description: scientific article; zbMATH DE number 4123853