Gröbner basis
In mathematics, and more specifically in computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis is a particular kind of generating set of an ideal in a polynomial ring K[x_1,\ldots,x_n]…
≈ 24 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics, and more specifically in computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis is a particular kind of generating set of an ideal in a polynomial ring K[x_1,\ldots,x_n] over a field K . A Gröbner basis allows many important properties of the ideal and the associated algebraic variety to be deduced easily, such as the dimension and the number of zeros when it is finite. Gröbner basis computation is one of the main practical tools for solving systems of polynomial equations and computing the images of algebraic varieties under projections or rational maps.
Gröbner basis computation can be seen as a multivariate, non-linear generalization of both Euclid's algorithm for computing polynomial greatest common divisors, and Gaussian elimination for linear systems. Gröbner bases were introduced by Bruno Buchberger in his 1965 Ph.D. thesis, which also included an algorithm to compute them (Buchberger's algorithm).
He named them after his advisor Wolfgang Gröbner. In 2007, Buchberger received the Association for Computing Machinery's Paris Kanellakis Theory and Practice Award for this work. However, the Russian mathematician Nikolai Günther had introduced a similar notion in 1913, published in various Russian mathematical journals.…
In mathematics, and more specifically in computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis is a particular kind of generating set of an ideal in a polynomial ring K[x_1,\ldots,x_n] over a field K . A Gröbner basis allows many important properties of the ideal and the associated algebraic variety to be deduced easily, such as the dimension and the number of zeros when it is finite. Gröbner basis computation is one of the main practical tools for solving systems of polynomial equations and computing the images of algebraic varieties under projections or rational maps.
Gröbner basis computation can be seen as a multivariate, non-linear generalization of both Euclid's algorithm for computing polynomial greatest common divisors, and Gaussian elimination for linear systems. Gröbner bases were introduced by Bruno Buchberger in his 1965 Ph.D. thesis, which also included an algorithm to compute them (Buchberger's algorithm).
He named them after his advisor Wolfgang Gröbner. In 2007, Buchberger received the Association for Computing Machinery's Paris Kanellakis Theory and Practice Award for this work. However, the Russian mathematician Nikolai Günther had introduced a similar notion in 1913, published in various Russian mathematical journals.
These papers were largely ignored by the mathematical community until their rediscovery in 1987 by Bodo Renschuch et al. An analogous concept for multivariate power series was developed independently by Heisuke Hironaka in 1964, who named them standard bases. This term has been used by some authors to also denote Gröbner bases.
The theory of Gröbner bases has been extended by many authors in various directions. It has been generalized to other structures such as polynomials over principal ideal rings or polynomial rings, and also some classes of non-commutative rings and algebras, like Ore algebras. Gröbner bases are primarily defined for ideals in a polynomial ring R=K[x_1,\ldots,x_n] over a field .
Although the theory works for any field, most Gröbner basis computations are done either when is the field of rationals or the integers modulo a prime number. In the context of Gröbner bases, a nonzero polynomial in R=K[x_1,\ldots,x_n] is commonly represented as a sum c_1M_1 +\cdots + c_mM_m, where the c_i are nonzero elements of , called coefficients, and the M_i are monomials (called power products by Buchberger and some of his followers) of the form x_1^{a_1}\cdots x_n^{a_n}, where the a_i are nonnegative integers.
The vector A=[a_1, \ldots ,a_n] is called the exponent vector of the monomial. When the list X=[x_1, \ldots, x_n] of the variables is fixed, the notation of monomials is often abbreviated as x_1^{a_1}\cdots x_n^{a_n}=X^A. Monomials are uniquely defined by their exponent vectors, and, when a monomial ordering (see below) is fixed, a polynomial is uniquely represented by the ordered list of the ordered pairs formed by an exponent vector and the corresponding coefficient.
This representation of polynomials is especially efficient for Gröbner basis computation in computers, although it is less convenient for other computations such as polynomial factorization and polynomial greatest common divisor. If F=\{f_1,\ldots, f_k\} is a finite set of polynomials in the polynomial ring , the ideal generated by is the set of linear combinations of elements of with coefficients in ; that is the set of polynomials that can be written \sum_{i=1}^k g_i f_i with g_1,\ldots, g_k\in R. Let M=x_1^{a_1}\cdots x_n^{a_n} and N=x_1^{b_1}\cdots x_n^{b_n} be two monomials, with exponent vectors A=[a_1,\ldots, a_n] and B=[b_1,\ldots, b_n]. One says that divides , or that is a multiple of , if a_i\le b_i for every ; that is, if is componentwise not greater than .
In this case, the quotient \frac NM is defined as \frac NM=x_1^{b_1-a_1}\cdots x_n^{b_n-a_n}. In other words, the exponent vector of \frac NM is the componentwise subtraction of the exponent vectors of and . The greatest common divisor of and is the monomial x_1^{\min(a_1,b_1)}\cdots x_n^{\min(a_n,b_n)} whose exponent vector is the componentwise minimum of and .
The least common multiple is defined similarly with instead of . One has \operatorname{lcm}(M,N)=\frac {MN}{\gcd(M,N)}.
Reduction
The reduction of a polynomial by other polynomials with respect to a monomial ordering is central to Gröbner basis theory. It is a generalization of both row reduction occurring in Gaussian elimination and division steps of the Euclidean division of univariate polynomials.
When completed as much as possible, it is sometimes called multivariate division although its result is not uniquely defined. Lead-reduction is a special case of reduction that is easier to compute. It is fundamental for Gröbner basis computation, since general reduction is needed only at the end of a Gröbner basis computation, for getting a reduced Gröbner basis from a non-reduced one.
Let an admissible monomial ordering be fixed, to which refers every monomial comparison that will occur in this section. A polynomial is lead-reducible by another polynomial if the leading monomial is a multiple of . The polynomial is reducible by if some monomial of is a multiple of .
(So, if is lead-reducible by , it is also reducible, but may be reducible without being lead-reducible.) Suppose that is reducible by , and let be a term of such that the monomial is a multiple of .
A one-step reduction of by consists of replacing by \operatorname{red}_1(f,g)=f-\frac{c}{\operatorname{lc}(g)}\,\frac m{\operatorname{lm}(g)}\, g. This operation removes the monomial from without changing the terms with a monomial greater than (for the monomial ordering). In particular, a one step lead-reduction of produces a polynomial all of whose monomials are smaller than .
Given a finite set of polynomials, one says that is reducible or lead-reducible by if it is reducible or lead-reducible, respectively, by at least one element of . In this case, a one-step reduction (resp. one-step lead-reduction) of by is any one-step reduction (resp. one-step lead-reduction) of by an element of .
The (complete) reduction (resp. lead-reduction) of by consists of iterating one-step reductions (respect. one-step lead reductions) until getting a polynomial that is irreducible (resp. lead-irreducible) by . It is sometimes called a normal form of by .
In general this form is not uniquely defined because there are, in general, several elements of that can be used for reducing ; this non-uniqueness is the starting point of Gröbner basis theory. The definition of the reduction shows immediately that, if is a normal form of by , one has f=h+\sum_{g\in G} q_g\,g, where is irreducible by and the q_g are polynomials such that \operatorname{lm}(q_g\,g) \leq \operatorname{lm}(f). In the case of univariate polynomials, if consists of a single element , then is the remainder of the Euclidean division of by , and is the quotient.
Moreover, the division algorithm is exactly the process of lead-reduction. For this reason, some authors use the term multivariate division instead of reduction.
In this two variable example, the monomial ordering that is used is the lexicographic order with x>y, and we consider the reduction of f=2x^3-x^2y+y^3+3y , by G=\{g_1,g_2\}, with \begin{align}g_1&=x^2+y^2-1,\\g_2&=xy-2.\end{align} For the first reduction step, either the first or the second term of may be reduced. However, the reduction of a term amounts to removing this term at the cost of adding new lower terms; if it is not the first reducible term that is reduced, it may occur that a further reduction adds a similar term, which must be reduced again.
It is therefore always better to reduce first the largest (for the monomial order) reducible term; that is, in particular, to lead-reduce first until getting a lead-irreducible polynomial. The leading term 2x^3 of is reducible by g_1 and not by g_2.
So the first reduction step consists of multiplying g_1 by and adding the result to : f\;\xrightarrow{-2xg_1}\; f_1=f-2xg_1=-x^2y-2xy^2+2x+y^3+3y. The leading term -x^2y of f_1 is a multiple of the leading monomials of both g_1 and g_2, So, one has two choices for the second reduction step. If one chooses g_2, one gets a polynomial that can be reduced again by g_2\colon f \;\xrightarrow{-2xg_1}\; f_1 \;\xrightarrow{xg_2}\; -2xy^2+y^3+3y \;\xrightarrow{2yg_2}\; f_2=y^3-y. No further reduction is possible, so f_2 is a complete reduction of .
One gets a different result with the other choice for the second step: f\;\xrightarrow{-2xg_1}\; f_1 \;\xrightarrow{yg_1}\; -2xy^2+2x+2y^3+2y \;\xrightarrow{2yg_2}\; f_3=2x+2y^3-2y. Again, the result f_3 is irreducible, although only lead reductions were done. In summary, the complete reduction of can result in either f_2=y^3-y or f_3=2x+2y^3-2y. It is for dealing with the problems set by this non-uniqueness that Buchberger introduced Gröbner bases and -polynomials.
Intuitively, 0 = f-f may be reduced to f_2-f_3. This implies that f_2-f_3 belongs to the ideal generated by . So, this ideal is not changed by adding f_3-f_2 to , and this allows more reductions.
In particular, f_3 can be reduced to f_2 by f_3-f_2 and this restores the uniqueness of the reduced form. Here Buchberger's algorithm for Gröbner bases would begin by adding to the polynomial g_3=yg_1-xg_2=2x+y^3-y. This polynomial, called -polynomial by Buchberger, is the difference of the one-step reductions of the least common multiple x^2y of the leading monomials of g_1 and g_2 , by g_2 and g_1 respectively: g_3 = \left( x^2 y - \frac{x^2y}{\mathrm{lt}(g_2)} g_2 \right) - \left( x^2 y - \frac{x^2y}{\mathrm{lt}(g_1)} g_1 \right) = \frac{x^2y}{\mathrm{lt}(g_1)} g_1 - \frac{x^2y}{\mathrm{lt}(g_2)} g_2 .
In this example, one has g_3=f_3-f_2. This does not complete Buchberger's algorithm, as gives different results, when reduced by g_2 or g_3. S(f,g) = \operatorname{red}_1 (\mathrm{lcm},g) - \operatorname{red}_1 (\mathrm{lcm},f) ; where denotes the least common multiple of the leading monomials of and .
Using the definition of \operatorname{red}_1 , this translates to: \begin{align}S(f,g) &= \left( \mathrm{lcm} - \frac{1}{\operatorname{lc}(g)}\,\frac{\mathrm{lcm}}{\operatorname{lm}(g)}\,g \right) - \left( \mathrm{lcm} - \frac{1}{\operatorname{lc}(f)}\,\frac{\mathrm{lcm}}{\operatorname{lm}(f)}\,f \right)\\ &= \frac{1}{\operatorname{lc}(f)}\,\frac{\mathrm{lcm}}{\operatorname{lm}(f)}\,f - \frac{1}{\operatorname{lc}(g)}\,\frac{\mathrm{lcm}}{\operatorname{lm}(g)}\,g\\ \end{align}. Using the property that relates the and the , the S-polynomial can also be written as: S(f,g) = \frac 1{\operatorname{lc}(f)}\,\frac{\operatorname{lm}(g)}{\mathrm{gcd}}\,f - \frac 1{\operatorname{lc}(g)}\,\frac{\operatorname{lm}(f)}{\mathrm{gcd}}\,g ; where denotes the greatest common divisor of the leading monomials of and .
As the monomials that are reducible by both and are exactly the multiples of , one can deal with all cases of non-uniqueness of the reduction by considering only the S-polynomials. This is a fundamental fact for Gröbner basis theory and all algorithms for computing them.
For avoiding fractions when dealing with polynomials with integer coefficients, the S polynomial is often defined as S(f,g) = \operatorname{lc}(g)\,\frac{\operatorname{lm}(g)}{\mathrm{gcd}}\,f - \operatorname{lc}(f)\,\frac{\operatorname{lm}(f)}{\mathrm{gcd}}\,g; This does not change anything to the theory since the two polynomials are associates.
Definition
Let R=F[x_1,\ldots,x_n] be a polynomial ring over a field . In this section, we suppose that an admissible monomial ordering has been fixed. Let be a finite set of polynomials in that generates an ideal .
The set is a Gröbner basis (with respect to the monomial ordering), or, more precisely, a Gröbner basis of if the ideal generated by the leading monomials of the polynomials in equals the ideal generated by the leading monomials of , or, equivalently, There are many characterizing properties, which can each be taken as an equivalent definition of Gröbner bases. For conciseness, in the following list, the notation "one-word/another word" means that one can take either "one-word" or "another word" for having two different characterizations of Gröbner bases.
All the following assertions are characterizations of Gröbner bases: Counting the above definition, this provides 12 characterizations of Gröbner bases. The fact that so many characterizations are possible makes Gröbner bases very useful.
For example, condition 3 provides an algorithm for testing ideal membership; condition 4 provides an algorithm for testing whether a set of polynomials is a Gröbner basis and forms the basis of Buchberger's algorithm for computing Gröbner bases; conditions 5 and 6 allow computing in R/I in a way that is very similar to modular arithmetic.
Existence
For every admissible monomial ordering and every finite set of polynomials, there is a Gröbner basis that contains and generates the same ideal. Moreover, such a Gröbner basis may be computed with Buchberger's algorithm.
This algorithm uses condition 4, and proceeds roughly as follows: for any two elements of , compute the complete reduction by of their S-polynomial, and add the result to if it is not zero; repeat this operation with the new elements of included until, eventually, all reductions produce zero. The algorithm terminates always because of Dickson's lemma or because polynomial rings are Noetherian (Hilbert's basis theorem).
Condition 4 ensures that the result is a Gröbner basis, and the definitions of S-polynomials and reduction ensure that the generated ideal is not changed. The above method is an algorithm for computing Gröbner bases; however, it is very inefficient.
Many improvements of the original Buchberger's algorithm, and several other algorithms have been proposed and implemented, which dramatically improve the efficiency. See , below.
Let R = \Q[x,y] be the ring of bivariate polynomials with rational coefficients and consider the ideal I = \langle f,g\rangle generated by the polynomials f=x^2-y , g=x^3-x . By reducing by , one obtains a new polynomial such that I=\langle f,k\rangle: k=g - xf= xy -x. None of and is reducible by the other, but is reducible by , which gives another polynomial in : h=xk-(y-1) f= y^2 -y. Under lexicographic ordering with x>y we have \mathrm{lt}(f) = x^2 \mathrm{lt}(k) = xy \mathrm{lt}(h) = y^2 As and belong to , and none of them is reducible by the others, none of \{f,k\}, \{f,h\}, and \{h,k\} is a Gröbner basis of . On the other hand, is a Gröbner basis of , since the S-polynomials \begin{align} yf-xk&=y(x^2-y)-x(xy-x)=f-h\\ yk-xh&=y(xy-x)-x(y^2-y)=0\\ y^2f-x^2h&= y(yf-xk)+x(yk-xh) \end{align} can be reduced to zero by and .
The method that has been used here for finding and , and proving that is a Gröbner basis is a direct application of Buchberger's algorithm. So, it can be applied mechanically to any similar example, although, in general, there are many polynomials and S-polynomials to consider, and the computation is generally too large for being done without a computer.
Equality of ideals
Reduced Gröbner bases are unique for any given ideal and any monomial ordering. Thus two ideals are equal if and only if they have the same (reduced) Gröbner basis (usually a Gröbner basis software always produces reduced Gröbner bases).
Membership and inclusion of ideals
The reduction of a polynomial f by the Gröbner basis G of an ideal yields 0 if and only if f is in . This allows to test the membership of an element in an ideal. Another method consists in verifying that the Gröbner basis of {{math|1=G∪{f }} is equal to G. To test if the ideal generated by is contained in the ideal , it suffices to test that every is in .
One may also test the equality of the reduced Gröbner bases of and . Both dimension and degree may be deduced from the Hilbert series of the ideal, which is the series \sum_{i=0}^\infty d_i t^i , where d_i is the number of monomials of degree i that are not multiple of any leading monomial in the Gröbner basis.
The Hilbert series may be summed into a rational fraction \sum_{i=0}^\infty d_it^i=\frac{P(t)}{(1-t)^d}, where d is the dimension of the ideal and P(t) is a polynomial. The number P(1) is the degree of the algebraic set defined by the ideal, in the case of a homogeneous ideal or a monomial ordering compatible with the degree; that is, to compare two monomials, one compares their total degrees first.
The dimension does not depend on the choice of a monomial ordering, although the Hilbert series and the polynomial P(t) may change with changes of the monomial ordering. However, for homogeneous ideals or monomial orderings compatible with the degree, the Hilbert series and the polynomial P(t) do not depend on the choice of monomial ordering.
Most computer algebra systems that provide functions to compute Gröbner bases provide also functions for computing the Hilbert series, and thus also the dimension and the degree. Consider a polynomial ring K[x_1,\ldots,x_n,y_1,\ldots,y_m]=K[X,Y], in which the variables are split into two subsets X and Y. Let us also choose an elimination monomial ordering "eliminating" X, that is a monomial ordering for which two monomials are compared by comparing first the X-parts, and, in case of equality only, considering the Y-parts.
This implies that a monomial containing an X-variable is greater than every monomial independent of X. If G is a Gröbner basis of an ideal I for this monomial ordering, then G\cap K[Y] is a Gröbner basis of I\cap K[Y] (this ideal is often called the elimination ideal). Moreover, G\cap K[Y] consists exactly of the polynomials of whose leading terms belong to (this makes the computation of G\cap K[Y] very easy, as only the leading monomials need to be checked).
This elimination property has many applications, some described in the next sections. Another application, in algebraic geometry, is that elimination realizes the geometric operation of projection of an affine algebraic set into a subspace of the ambient space: with above notation, the (Zariski closure of) the projection of the algebraic set defined by the ideal I into the Y-subspace is defined by the ideal I\cap K[Y]. The lexicographical ordering such that x_1>\cdots >x_n is an elimination ordering for every partition \{x_1, \ldots, x_k\},\{x_{k+1},\ldots,x_n\}.
Thus a Gröbner basis for this ordering carries much more information than usually necessary. This may explain why Gröbner bases for the lexicographical ordering are usually the most difficult to compute. K=\langle tf_1,\ldots, tf_m, (1-t)g_1, \ldots, (1-t)g_k\rangle.
In other words, is obtained by eliminating t in K. This may be proven by observing that the ideal K consists of the polynomials (a-b)t+b such that a\in I and b\in J . Such a polynomial is independent of t if and only if , which means that b\in I\cap J. x_1 &= \frac{f_1(t)}{g_1(t)}\\ &\;\;\vdots\\ x_n &= \frac{f_n(t)}{g_n(t)}, \end{align} where f_i(t) and g_i(t) are univariate polynomials for 1 ≤ i ≤ n. One may (and will) suppose that f_i(t) and g_i(t) are coprime (they have no non-constant common factors). Implicitization consists in computing the implicit equations of such a curve.
In case of n = 2, that is for plane curves, this may be computed with the resultant. The implicit equation is the following resultant: \text{Res}_t(g_1x_1-f_1,g_2x_2-f_2). Elimination with Gröbner bases allows to implicitize for any value of n, simply by eliminating t in the ideal \langle g_1x_1-f_1,\ldots, g_nx_n-f_n\rangle.
If n = 2, the result is the same as with the resultant, if the map t \mapsto (x_1,x_2) is injective for almost every t. In the other case, the resultant is a power of the result of the elimination. The localization of a ring consists in adjoining to it the formal inverses of some elements.
This section concerns only the case of a single element, or equivalently a finite number of elements (adjoining the inverses of several elements is equivalent to adjoining the inverse of their product). The localization of a ring R by an element f is the ring R_f=R[t]/(1-ft), where t is a new indeterminate representing the inverse of f. The localization of an ideal of R is the ideal I_f=R_fI of R_f. When R is a polynomial ring, computing in R_f is not efficient because of the need to manage the denominators.
Therefore, localization is usually replaced by the operation of saturation. The with respect to f of an ideal in R is the inverse image of R_f I under the canonical map from R to R_f. It is the ideal I:f^\infty= \{g\in R \mid (\exists k\in \mathbb N) f^k g\in I\} consisting in all elements of R whose product with some power of f belongs to .
If is the ideal generated by and 1−ft in R[t], then I:f^\infty = J\cap R. It follows that, if R is a polynomial ring, a Gröbner basis computation eliminating t produces a Gröbner basis of the saturation of an ideal by a polynomial. The important property of the saturation, which ensures that it removes from the algebraic set defined by the ideal the irreducible components on which the polynomial f is zero, is the following: The primary decomposition of I:f^\infty consists of the components of the primary decomposition of I that do not contain any power of f. If one wants to saturate with respect to several polynomials f_1,\ldots, f_k or with respect to a single polynomial which is a product f = f_1 \cdots f_k, there are three ways to proceed which give the same result but may have very different computation times (it depends on the problem which is the most efficient).
Saturating by f = f_1 \cdots f_k in a single Gröbner basis computation. Saturating by f_1, then saturating the result by f_2, and so on. Adding to F or to its Gröbner basis the polynomials 1-t_1f_1, \ldots, 1-t_kf_k, and eliminating the t_i in a single Gröbner basis computation.
Implicitization in higher dimension
By definition, an affine rational variety of dimension k may be described by parametric equations of the form \begin{align} x_1&=\frac{p_1}{p_0}\\ &\;\;\vdots\\ x_n&=\frac{p_n}{p_0}, \end{align} where p_0,\ldots,p_n are n+1 polynomials in the k variables (parameters of the parameterization) t_1,\ldots,t_k. Thus the parameters t_1,\ldots,t_k and the coordinates x_1,\ldots,x_n of the points of the variety are zeros of the ideal I=\bigl\langle p_0x_1-p_1, \ldots, p_0x_n-p_n\bigr\rangle. One could guess that it suffices to eliminate the parameters to obtain the implicit equations of the variety, as it has been done in the case of curves.
Unfortunately this is not always the case. If the p_i have a common zero (sometimes called base point), every irreducible component of the non-empty algebraic set defined by the p_i is an irreducible component of the algebraic set defined by I. It follows that, in this case, the direct elimination of the t_i provides an empty set of polynomials.
Therefore, if k>1, two Gröbner basis computations are needed to implicitize: Saturate I by p_0 to get a Gröbner basis G Eliminate the t_i from G to get a Gröbner basis of the ideal (of the implicit equations) of the variety. In the worst case, the main parameter of the complexity is the maximal degree of the elements of the resulting reduced Gröbner basis.
More precisely, if the Gröbner basis contains an element of a large degree , this element may contain \Omega(D^n) nonzero terms whose computation requires a time of \Omega(D^n)>D^{\Omega(n)}. On the other hand, if all polynomials in the reduced Gröbner basis a homogeneous ideal have a degree of at most , the Gröbner basis can be computed by linear algebra on the vector space of polynomials of degree less than , which has a dimension O(D^n). So, the complexity of this computation is O(D^n)^{O(1)}= D^{O(n)}.
The worst-case complexity of a Gröbner basis computation is doubly exponential in . More precisely, the complexity is upper bounded by a polynomial in d^{2^n}. Using little o notation, it is therefore bounded by d^{2^{n+o(n)}}.
On the other hand, examples have been given of reduced Gröbner bases containing polynomials of degree d^{2^{\Omega(n)}}, or containing d^{2^{\Omega(n)}} elements. As every algorithm for computing a Gröbner basis must write its result, this provides a lower bound of the complexity. Gröbner basis is EXPSPACE-complete.
Error-Correcting Codes
Gröbner bases have been applied in the theory of error-correcting codes for algebraic decoding. By using Gröbner basis computation on various forms of error-correcting equations, decoding methods were developed for correcting errors of cyclic codes, affine variety codes, algebraic-geometric codes and even general linear block codes. Applying Gröbner basis in algebraic decoding is still a research area of channel coding theory.
See also
Bergman's diamond lemma, an extension of Gröbner bases to non-commutative rings Graver basis Janet basis Regular chains, an alternative way to represent algebraic sets
Further reading
[This is Buchberger's thesis inventing Gröbner bases.] (This is the journal publication of Buchberger's thesis.) (translated from Sibirsk.
Mat. Zh. Siberian Mathematics Journal 3 (1962), 292–296).
(on infinite dimensional Gröbner bases for polynomial rings in infinitely many indeterminates).
Text derived from https://en.wikipedia.org/w/index.php?oldid=1371778743 under CC BY-SA 4.0; modifications have been made.