Buchberger's algorithm

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In computational algebraic geometry and computational commutative algebra, Buchberger's algorithm is a method of transforming a given set of generators for a polynomial ideal into a Gröbner basis with respect to some monomial order. It was invented by Austrian mathematician Bruno Buchberger. One can view it as a generalization of the Euclidean algorithm for univariate GCD computation and of Gaussian elimination for linear systems.

A crude version of this algorithm to find a basis for an ideal I of a polynomial ring R proceeds as follows:

Input A set of polynomials F that generates I
Output A Gröbner basis G for I
  1. G := F
  2. For every fi, fj in G, denote by gi the leading term of fi with respect to the given ordering, and by aij the least common multiple of gi and gj.
  3. Choose two polynomials in G and let Sij = (aij / gi) fi − (aij / gj) fj (Note that the leading terms here will cancel by construction).
  4. Reduce Sij, with the multivariate division algorithm relative to the set G until the result is not further reducible. If the result is non-zero, add it to G.
  5. Repeat steps 1-4 until all possible pairs are considered, including those involving the new polynomials added in step 4.
  6. Output G

The polynomial Sij is commonly referred to as the S-polynomial, where S refers to subtraction (Buchberger) or Syzygy (others). The pair of polynomials with which it is associated is commonly referred to as critical pair.

There are numerous ways to improve this algorithm beyond what has been stated above. For example, one could reduce all the new elements of F relative to each other before adding them. If the leading terms of fi and fj share no variables in common, then Sij will always reduce to 0 (if we use only fi and fj for reduction), so we needn't calculate it at all.

The algorithm terminates because it is consistently increasing the size of the monomial ideal generated by the leading terms of our set F, and Dickson's lemma (or the Hilbert basis theorem) guarantees that any such ascending chain must eventually become constant. Unfortunately, it may take a very long time to terminate, corresponding to the fact that Gröbner bases can be extremely large. Thus, it has large storage requirements (space complexity). Also, the time complexity of the algorithm is doubly exponential in the input data, which implies that its worst-case behavior can be very slow.

Further methods for computing Gröbner bases include the Faugère F4 algorithm, based on the same mathematics as the Buchberger algorithm, and involutive approaches, based on ideas from Differential algebra.

See also[edit]

References[edit]

  • Buchberger, B. (August 1976). "Theoretical Basis for the Reduction of Polynomials to Canonical Forms". ACM SIGSAM Bull. (ACM) 10 (3): 19–29. doi:10.1145/1088216.1088219. MR 0463136. 
  • David Cox, John Little, and Donald O'Shea (1997). Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, Springer. ISBN 0-387-94680-2.
  • Vladimir P. Gerdt, Yuri A. Blinkov (1998). Involutive Bases of Polynomial Ideals, Mathematics and Computers in Simluation, 45:519ff

External links[edit]