Gröbner bases, an introduction (Q4238957)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1276812
Language Label Description Also known as
default for all languages
No label defined
    English
    Gröbner bases, an introduction
    scientific article; zbMATH DE number 1276812

      Statements

      0 references
      20 April 1999
      0 references
      Gröbner bases
      0 references
      Buchberger algorithm
      0 references
      effective ring
      0 references
      polynomial ring
      0 references
      polynomial equations
      0 references
      Gröbner bases, an introduction (English)
      0 references
      Gröbner bases is a core topic in computer algebra. There are several ways of looking at the famous Buchberger algorithm for computing Gröbner bases. The author gives three interpretations, by showing how the following three problems can be attacked in the light of Gröbner bases. (1) Given an effective ring \(R\), provide algorithms turning the polynomial ring \(R[X_1,\dots,X_n]\) into an effective ring. (2) Given an effective field \(K\) and a set of polynomial equations over \(K\) in the variables \(\{X_1,\dots,X_n\}\), produce a `triangular form' of the equations, so that one can look for solutions by elimination of variables. (3) Given a finite subset \(B\) of \(K[{\mathcal X}]=K[X_1,\dots,X_n]\), produce an effectively computable \(K\)-linear projection map from \(K[{\mathcal X}]\) onto a complement of the ideal \((B)\) in \(K[{\mathcal X}]\). This gives an effectively computable way of representing the quotient \(K[{\mathcal X}]/(B)\). For the entire collection see [Zbl 0924.13021].
      0 references

      Identifiers