Buchberger's algorithm: Difference between revisions

Content deleted Content added
ce
Corrected a misprint (removed 'be' in 'denote by ''g<sub>i</sub>'' be')
Line 6:
:'''Output''' A [[Gröbner basis]] for ''I''
:# ''G'' := ''F''
:# For every ''f<sub>i</sub>'', ''f<sub>j</sub>'' in ''G'', denote by ''g<sub>i</sub>'' be the leading term of ''f<sub>i</sub>'' with respect to the given ordering, and by ''a<sub>ij</sub>'' the [[least common multiple]] of ''g<sub>i</sub>'' and ''g<sub>j</sub>'' by.
:# Choose two polynomials in ''G'' and let ''S''<sub>''ij''</sub> = (''a''<sub>''ij''</sub> / ''g''<sub>''i''</sub>) ''f''<sub>''i''</sub> &minus; (''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''.