Abstract
Purchase PDF (494 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
. Consider the mapping 
doi:10.1016/j.jsc.2007.02.002 
Copyright © 2007 Elsevier Ltd All rights reserved.
Are Buchberger’s criteria necessary for the chain condition?
Received 2 August 2006;
| Referred to by: | | Corrigendum to “Are Buchberger’s criteria necessary for the chain condition?” [J. Symbolic Comput. 42 (2007) 717–732] Journal of Symbolic Computation, Volume 43, Issue 3, March 2008, Page 233 Hoon Hong, John Perry  PDF (101 K)
|
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Buchberger’s Gröbner 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 an extension to Buchberger’s criteria that is necessary as well as sufficient.
Keywords: Gröbner bases; S-polynomials; Buchberger criteria
