Skip to main content
×
×
Home

An extension of Buchberger’s criteria for Gröbner basis decision

  • John Perry (a1)
Abstract
Abstract

Two fundamental questions in the theory of Gröbner bases are decision (‘Is a basis G of a polynomial ideal a Gröbner basis?’) and transformation (‘If it is not, how do we transform it into a Gröbner basis?’) This paper considers the first question. It is well known that G is a Gröbner basis if and only if a certain set of polynomials (the S-polynomials) satisfy a certain property. In general there are m(m−1)/2 of these, where m is the number of polynomials in G, but criteria due to Buchberger and others often allow one to consider a smaller number. This paper presents two original results. The first is a new characterization theorem for Gröbner bases that makes use of a new criterion that extends Buchberger’s criteria. The second is the identification of a class of polynomial systems G for which the new criterion has dramatic impact, reducing the worst-case scenario from m(m−1)/2 S-polynomials to m−1.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      An extension of Buchberger’s criteria for Gröbner basis decision
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about sending content to Dropbox.

      An extension of Buchberger’s criteria for Gröbner basis decision
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about sending content to Google Drive.

      An extension of Buchberger’s criteria for Gröbner basis decision
      Available formats
      ×
Copyright
References
Hide All
[1] Adams W. and Loustaunau P., An introduction to Gröbner bases, Graduate Studies in Mathematics 3 (American Mathematical Society, Providence, RI, 1994).
[2] Backelin J. and Fröberg R., ‘How we proved that there are exactly 924 cyclic-7 roots’, ISSAC ’91: Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation (ACM Press, New York, NY, 1991) 103111, ISBN:0-89791-437-6.
[3] Becker T., Weispfenning V. and Kredel H., Gröbner bases: a computational approach to commutative algebra (Springer, New York, 1993).
[4] Buchberger B., ‘Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalem Polynomideal (an algorithm for finding the basis elements in the residue class ring modulo a zero dimensional polynomial ideal)’. PhD Thesis, Mathematical Institute, University of Innsbruck, Austria, 1965. English translation published in J. Symbolic Comput. 41 (2006) 475–511.
[5] Buchberger B., ‘An algorithmic criterion for the solvability of a system of algebraic equations’, Aequationes Math. 4 (1970) 374383 Gröbner Bases and Applications, London Mathematical Society Lecture Note Series 251 (1998) (English translation).
[6] Buchberger B., ‘A criterion for detecting unnecessary reductions in the construction of Gröbner bases’, Proceedings of the EUROSAM 79 Symposium on Symbolic and Algebraic Manipulation, Marseille, 26–28 June 1979, Lecture Notes in Computer Science 72 (ed. Ng E. W.; Springer, Berlin, 1979) 321.
[7] Buchberger B., ‘Gröbner-bases: an algorithmic method in polynomial ideal theory’, Multidimensional systems theory — progress, directions and open problems in multidimensional systems, (ed. Bose N. K.; Reidel, Dordrecht, 1985) 184232.
[8] Caboara M., Kreuzer M. and Robbiano L., ‘Minimal sets of critical pairs’, Proceedings of the First Congress of Mathematical Software, (eds Cohen B., Gao X. and Takayama N.; World Scientific, Singapore, 2002) 390404.
[9] Cohen A. M., Cuypers H. and Sterk H. (eds) Some tapas of computer algebra, Algorithms and Computation in Mathematics 4 (Springer, Berlin, 1999).
[10] Cox D., Little J. and O’Shea D., Ideals, varieties, and algorithms, 2nd edn (Springer, New York, 1997).
[11] Cox D., Little J. and O’Shea D., Using algebraic geometry (Springer, New York, 1998).
[12] Gebauer R. and Möller H., ‘On an installation of Buchberger’s algorithm’, J. Symbolic Comput. 6 (1988) 275286.
[13] Hong H. and Perry J., ‘Are Buchberger’s criteria necessary for the chain condition?’, J. Symbolic Comput. 42 (2007) 717732.
[14] Jacobi C. G. J., ‘De binis quibuslibet functionibus homogeneis secundi ordinis per substitutiones lineares in alias binas transformandis, quae solis quadratis variabilium constant; una cum variis theorematis de transformatione et determinatione integralium multiplicium’, J. Reine Angew. Math. 12 (1833) 169.
[15] Kollreider C. and Buchberger B., ‘An improved algorithmic construction of Gröbner-bases for polynomial ideals’, ACM SIGSAM Bull. 12 (1978) 2736.
[16] Kreuzer M. and Robbiano L., Computational commutative algebra I (Springer, Heidelberg, 2000).
[17] Lazard D., ‘Gröbner bases, Gaussian elimination, and resolution of systems of algebraic equations’, EUROCAL ’83, European Computer Algebra Conference, Lecture Notes in Computer Science 162 (ed. van Hulzen J. A.; Springer, Berlin, 1983) 146156.
[18] Möller H., Mora F. and Traverso C., ‘Gröbner bases computation using syzygies’, Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, Association for Computing Machinery (ed. Wang P. S.; ACM Press, New York, NY, 1992) 320328.
[19] Rice A. and Torrence E., ‘Shutting up like a telescope: Lewis Carroll’s curious condensation method for evaluating determinants’, College Math. J. 38 (2007) 8595.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

LMS Journal of Computation and Mathematics
  • ISSN: -
  • EISSN: 1461-1570
  • URL: /core/journals/lms-journal-of-computation-and-mathematics
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×
MathJax

Keywords:

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 29 *
Loading metrics...

Abstract views

Total abstract views: 45 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 15th December 2017. This data will be updated every 24 hours.