Back to Search
Start Over
Are Buchberger’s criteria necessary for the chain condition?
- Source :
- Journal of Symbolic Computation. (7):717-732
- Publisher :
- Elsevier Ltd.
-
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.
- Subjects :
- Algebra and Number Theory
Carry (arithmetic)
010102 general mathematics
010103 numerical & computational mathematics
Extension (predicate logic)
Symbolic computation
01 natural sciences
Buchberger criteria
Algebra
Computational Mathematics
Gröbner basis
Chain (algebraic topology)
S-polynomials
Buchberger's algorithm
Gröbner bases
0101 mathematics
Mathematics
Subjects
Details
- Language :
- English
- ISSN :
- 07477171
- Issue :
- 7
- Database :
- OpenAIRE
- Journal :
- Journal of Symbolic Computation
- Accession number :
- edsair.doi.dedup.....0bc6a3c3228acfc938562316bb622fc4
- Full Text :
- https://doi.org/10.1016/j.jsc.2007.02.002