Are Buchberger's Criteria Necessary For the Chain Condition?
Buchberger's Grobner basis theory plays a fundamental role in symbolic Computation. The resulting algorithms essentially carry out several S-polynomial reductions. In his Ph.D. thesis and later publication Buchberger showed that sometimes one can skip S-polynomial reductions if the leading terms of polynomials satisfy certain criteria. A question naturally arises: Are Buchberger's criteria also necessary for skipping S-polynomial reductions? In this paper, after making the question more precise (in terms of a chain condition), we show the answer to be "almost, but not quite": necessary when there are four or more polynomials, but not necessary when there are exactly three polynomials. For that case, We found ail extension to Buchberger's criteria that is necessary as well as sufficient. (c) 2007 Elsevier Ltd. All rights reserved.
Journal of Symbolic Computation
Perry, J. E.
(2007). Are Buchberger's Criteria Necessary For the Chain Condition?. Journal of Symbolic Computation, 42(7), 717-732.
Available at: http://aquila.usm.edu/fac_pubs/1974