Citations

Previous

Up

Next

Article

From References: 0 From Reviews: 0

MR2638984 (2011d:13046) 13P10 (68W30) Perry, John [Perry, John Edward, III] (1-SMS) An extension of Buchbergers criteria for Gr bner basis decision. (English summary) o LMS J. Comput. Math. 13 (2010), 111129. The paper addresses the question of how to recognize whether a system of multivariate polynomials G = (g1 , . . . , gm ) over a eld is a Gr bner basis. According to a well-known characterization, G o is a Gr bner basis iff the S-polynomial of any two gi reduces to zero with respect to G. Taken ad o litteram, this requires examination of m(m 1)/2 S-polynomials. The computational effort can be sometimes diminished, thanks to two criteria of Buchberger ensuring that certain S-polynomials surely reduce to zero with respect to G. The author presents another criterion to the same effect. Say that a nite set of terms (t1 , . . . , tm ) satises condition (EC) if gcd(t1 , tm ) divides tk for any k from 1 to m, and for any variable x, either degx gcd(t1 , tm ) = 0 or (degx t1 , . . . , degx tm ) is a monotonic sequence. The main theorem of the paper says that G is a Gr bner basis if for every o i, j with 1 i < j m there exist k1 , . . . , kn such that i = k1 , j = kn , the list of leading terms of gk1 , . . . , gkn satises (EC), and each S-polynomial S(gkt , gkt+1 ) (t = 1, . . . , n 1) reduces to zero with respect to (gk1 , . . . , gkn ). The author points out a class of polynomials for which the new criterion allows one to verify whether m polynomials form a Gr bner basis by examining m 1 o S-polynomials. The proof relies on results of linear algebra that present their own interest. The paper makes for very enjoyable reading; the author discusses many examples which help the reader to appreciate the novelty and importance of his results. Reviewed by Mihai Cipu References 1. W. Adams and P. Loustaunau, An introduction to Gr bner bases, Graduate Studies in Matheo matics 3 (American Mathematical Society, Providence, RI, 1994). MR1287608 (95g:13025) 2. J. Backelin and R. Fr berg, How we proved that there are exactly 924 cyclic-7 roots, ISSAC o 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. T. Becker, V. Weispfenning and H. Kredel, Gr bner bases: a computational approach to o commutative algebra (Springer, New York, 1993). MR1213453 (95e:13018) 4. B. Buchberger, Ein Algorithmus zum Aufnden der Basiselemente des Restklassenringes nach einem nulldimensionalem Polynomideal (an algorithm for nding 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) 475511. MR2202561 (2006m:68183) 5. B. Buchberger, An algorithmic criterion for the solvability of a system of algebraic equations, Aequationes Math. 4 (1970) 374383 Gr ner Bases and Applications, London Mathematical o

6.

7.

8.

9. 10. 11. 12. 13. 14.

15. 16. 17.

18.

19.

Society Lecture Note Series 251 (1998) (English translation). B. Buchberger, A criterion for detecting unnecessary reductions in the construction of Gr bner o bases, Proceedings of the EUROSAM 79 Symposium on Symbolic and Algebraic Manipulation, Marseille, 2628 June 1979, Lecture Notes in Computer Science 72 (ed. E. W. Ng; Springer, Berlin, 1979) 321. MR0575678 (82e:14004) B. Buchberger, Gr bner-bases: an algorithmic method in polynomial ideal theory, Multidio mensional systems theoryprogress, directions and open problems in multidimensional systems, (ed. N. K. Bose; Reidel, Dordrecht, 1985) 184232. M. Caboara, M. Kreuzer and L. Robbiano, Minimal sets of critical paris, Proceedings of the First Congress of Mathematical Software, (eds B. Cohen, X. Gao and N. Takayama; World Scientic, Singapore, 2002) 390404. MR1932624 A. M. Cohen, H. Cuypers and H. Sterk (eds) Some tapas of computer algebra, Algorithms and Computation in Mathematics 4 (Springer, Berlin, 1999). MR1679917 (99k:00038) D. Cox, J. Little and D. OShea, Ideals, varieties, and algorithms, 2nd edn (Springer, New York, 1997). MR1417938 (97h:13024) D. Cox, J. Little and D. OShea, Using algebraic geometry (Springer, New York, 1998). MR1639811 (99h:13033) R. Gebauer and H. M ller, On an installation of Buchbergers algorithm, J. Symbolic Comput. o 6 (1988) 275286. MR0988418 (91a:13014) H. Hong and J. Perry, Are Buchbergers criteria necessary for the chain condition?, J. Symbolic Comput. 42 (2007) 717732. MR2348058 (2009b:68257a) C. G. J. Jacobi, 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. C. Kollreider and B. Buchberger, An improved algorithmic construction of Gr bner-bases for o polynomial ideals, ACM SIGSAM Bull. 12 (1978) 2736. M. Kreuzer and L. Robbiano, Computational commutative algebra I (Springer, Heidelberg, 2000). MR1790326 (2001j:13027) D. Lazard, Gr bner bases, Gaussian elimination, and resolution of systems of algebraic equao tions, EUROCAL 83, European Computer Algebra Conference, Lecture Notes in Computer Science 162 (ed. J. A. van Hulzen; Springer, Berlin, 1983) 146156. MR0774807 (86m:13002) H. M ller, F. Mora and C. Traverso, Gr bner bases computation using syzygies, Proceedings o o of the 1992 International Symposium on Symbolic and Algebraic Computation, Association for Computing Machinery (ed. P. S. Wang; ACM Press, New York, NY, 1992) 320328. A. Rice and E. Torrence, Shutting up like a telescope: Lewis Carrolls curious condensation method for evaluating determinants, College Math. J. 38 (2007) 8595. MR2293913 (2008d:15023)
Note: This list reects references listed in the original paper as accurately as possible with no attempt to correct errors.

c Copyright American Mathematical Society 2011, 2012