Buchberger's algorithm: Difference between revisions

Content deleted Content added
m doi-access=free for a reference
Muf99 (talk | contribs)
m Fixed a typo in the algorithm; only steps 2-4 loop, not step 1
Line 10:
:# Choose two polynomials in ''G'' and let ''S''<sub>''ij''</sub> = (''a''<sub>''ij''</sub> / ''g''<sub>''i''</sub>) ''f''<sub>''i''</sub> − (''a''<sub>''ij''</sub> / ''g''<sub>''j''</sub>) ''f''<sub>''j''</sub> ''(Note that the leading terms here will cancel by construction)''.
:# Reduce ''S''<sub>''ij''</sub>, 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''.
:# Repeat steps 12-4 until all possible pairs are considered, including those involving the new polynomials added in step 4.
:# Output ''G''