Hilbert Functions and the Buchberger Algorithm

Abstract In this paper we show how to use the knowledge of the Hilbert–Poincare series of an ideal I to speed up the Buchberger algorithm for the computation of a Grobner basis. The algorithm is useful in the change of ordering and in the validation of modular computations, also with tangent cone orderings; speeds the direct computation of a Grobner basis if the ideal is a complete intersection, e.g. in the computation of cartesian from parametric equations, can validate or disprove a conjecture that an ideal is a complete intersection, and is marginally useful also when the conjecture is false. A large set of experiments is reported.

[1]  G. Björck,et al.  A Faster Way to Count the Solution of Inhomogeneous Systems of Algebraic Equations, with Applications to Cyclic n-Roots , 1991, J. Symb. Comput..

[2]  H. Michael Möller,et al.  The computation of the Hilbert function , 1983, EUROCAL.

[3]  Anna Maria Bigatti.  Computation of Hilbert-Poincaré series , 1997 .

[4]  Pasqualina Conti,et al.  A Case of Automatic Theorem Proving in Euclidean Geometry: the Maclane 83Theorem , 1995, AAECC.

[5]  David Shannon,et al.  Using Gröbner Bases to Determine Algebra Membership Split Surjective Algebra Homomorphisms Determine Birational Equivalence , 1988, J. Symb. Comput..

[6]  Stephen M. Watt,et al.  The singular value decomposition for polynomial systems , 1995, ISSAC '95.

[7]  Richard Pavelle,et al.  MACSYMA: Capabilities and Applications to Problems in Engineering and the Sciences , 1985, European Conference on Computer Algebra.

[8]  Michael Kalkbrener,et al.  Converting Bases with the Gröbner Walk , 1997, J. Symb. Comput..

[9]  Alan K. Jones.  Geometric & Solid Modeling: An Introduction (Christoph M. Hoffman) , 1992, SIAM Rev..

[10]  D. Bayer.  The division algorithm and the hilbert scheme , 1982 .

[11]  Teo Mora,et al.  La queste del saint Gra(AL): A computational approach to local algebra , 1991, Discret. Appl. Math..

[12]  H. Michael Möller,et al.  Computational aspects of reduction strategies to construct resolutions of monomial ideals , 1984, AAECC.

[13]  H. M. Möller,et al.  New Constructive Methods in Classical Ideal Theory , 1986 .

[14]  Roberto La Scala.  An algorithm for complexes , 1994, ISSAC '94.

[15]  Daniel Lazard,et al.  Resolution des Systemes d'Equations Algebriques , 1981, Theor. Comput. Sci..

[16]  Carlo Traverso,et al.  “One sugar cube, please” or selection strategies in the Buchberger algorithm , 1991, ISSAC '91.

[17]  Carlo Traverso,et al.  Gröbner Trace Algorithms , 1988, ISSAC.

[18]  Gerhard Pfister,et al.  Advances and improvements in the theory of standard bases and syzygies , 1996 .

[19]  Teo Mora,et al.  Implicitization of hypersurfaces and curves by the Primbasissatz and basis conversion , 1994, ISSAC '94.

[20]  Carlo Traverso,et al.  Experimenting the Gröbner basis algorithm with the A1PI system , 1989, ISSAC '89.

[21]  Teo Mora,et al.  The Gröbner Fan of an Ideal , 1988, J. Symb. Comput..

[22]  D. A. Spear.  A constructive approach to commutative ring theory , 1977 .

[23]  Hans Schönemann,et al.  Standard bases, syzygies and their implementation in SINGULAR , 1994 .

[24]  Heinz Kredel,et al.  Some Examples for Solving Systems of Algebraic Equations by Calculating Groebner Bases , 1986, J. Symb. Comput..

[25]  H. Michael Möller,et al.  Upper and Lower Bounds for the Degree of Groebner Bases , 1984, Symbolic and Algebraic Computation.

[26]  Harvey Cohn,et al.  An explicit modular equation in two variables and Hilbert’s twelfth problem , 1982 .

[27]  Carlo Traverso,et al.  Gröbner bases computation using syzygies , 1992, ISSAC '92.

[28]  Massimo Caboara,et al.  Multigraded Hilbert functions and Buchberger algorithm , 1996, ISSAC '96.

[29]  Patrizia M. Gianni,et al.  Algebraic Solution of Systems of Polynomial Equations Using Groebner Bases , 1987, AAECC.

[30]  Xiao-Shan Gao,et al.  Solving parametric algebraic systems , 1992, ISSAC '92.

[31]  G. Björck,et al.  Functions of modulus 1 on Zn whose Fourier transforms have constant modulus, and , 1990 .