International Symposium on Symbolic and Algebraic Manipulation

EUROSAM 1979: Symbolic and Algebraic Computation pp 3-21 | Cite as

A criterion for detecting unnecessary reductions in the construction of Gröbner-bases

  • B. Buchberger
1. Simplification
Part of the Lecture Notes in Computer Science book series (LNCS, volume 72)


We present a new criterion that may be applied in an algorithm for constructing Gröbner-bases of polynomial ideals. The application of the criterion may drastically reduce the number of reductions of polynomials in the course of the algorithm. Incidentally, the new criterion allows to derive a realistic upper bound for the degrees of the polynomials in the Gröbner-bases computed by the algorithm in the case of polynomials in two variables.


Polynomial Ideal Algorithmic Construction Common Multiple Termination Proof Residue Class Ring 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. /1/.
    B. Buchberger, Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems, Aequationes mathematicea, Vol. 4/3, 374–383, 1970Google Scholar
  2. /2/.
    B. Buchberger, A Theoretical Basis for the Reduction of Polynomials to Canonical Forms, ACM SIGSAM Bulletin 39, 19–29, August 1976Google Scholar
  3. /3/.
    B. Buchberger, Some Properties of Gröbner-Bases for Polynomial Ideals, ACM SIGSAM Bulletin 40, 19–24, November 1976Google Scholar
  4. /4/.
    R. Loos, Toward a Formal Implementation of Computer Algebra, Proceedings of EUROSAM 1974, ACM SIGSAM Bulletin 8, 9–16, August 1974Google Scholar
  5. /5/.
    M. Lauer, Canonical Representatives for Residue Classes of a Polynomial Ideal, Proceedings of ACM SIGSAM 1976, 339–345Google Scholar
  6. /6/.
    D.A. Spear, A Constructive Approach to Commutative Ring Theory, Proceedings of the MACSYMA User's Conference 1977, M.I.T.Google Scholar
  7. /7/.
    W. Trinks, Über B. Buchbergers Verfahren, Systeme algebraischer Gleichnungen zu lösen, J. of Number Theory, Vol. 10/4, 475–488, 1978Google Scholar
  8. /8/.
    R. Schrader, Diplomarbeit, Univ. Karlsruhe, Math. Inst., 1977Google Scholar
  9. /9/.
    M. Lauer, Diplomarbeit, Univ. Karlsruhe, Inst. für Informatik, 1977Google Scholar
  10. /10/.
    F. Winkler, Implementierung eines Algorithmus zur Konstruktion von Gröbner-Basen, Diplomarbeit, Univ. Linz (Austria), Math. Inst., 1978Google Scholar
  11. /11/.
    C. Kollreider, B. Buchberger, An Improved Algorithmic Construction of Gröbner-Bases for Polynomial Ideals, ACM SIGSAM Bulletin, to appear 1979Google Scholar
  12. /12/.
    C. Kollreider, Polynomial Reduction: A Termination Proof for a Reduction Algorithm, Bericht Nr. 123, Math. Inst., Univ. Linz (Austria) 1978Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • B. Buchberger
    • 1
  1. 1.Institut für Mathematik Johannes-Kepler-UniversitätLinzAustria

Personalised recommendations