M.-J. Gonzalez-Lopez
Abstract
This paper shows how to solve homogeneous polynomial systems that contain parameters. The Hilbert function is used to check that the specialization of a 'generic' Gröbner basis of the parametric homogeneous polynomial system (computed in a polynomial ring containing the parameters and the unknowns as variables) is a Gröbner basis of the specialized homogeneous polynomial system. A preliminary implementation of these algorithms in PoSSoLib is also reported.
Index Terms
- Gröbner bases specialization through Hilbert functions: the homogeneous case
Recommendations
Computing comprehensive Gröbner systems and comprehensive Gröbner bases simultaneously
ISSAC '11: Proceedings of the 36th international symposium on Symbolic and algebraic computationIn Kapur et al (ISSAC, 2010), a new method for computing a comprehensive Grobner system of a parameterized polynomial system was proposed and its efficiency over other known methods was effectively demonstrated. Based on those insights, a new approach ...
Gröbner bases and Hilbert schemes. I
Let <"@s be a sequential term ordering of the set T of all monomials in the variables x"1,...x"n.The author studies the family A of all ideals in K[x"1,...,x"n], that have the reduced Grobner basis with respect to <"@s with the same associated monomial ...
Gröbner bases and logarithmic D-modules
Let C[x]=C[x"1,...,x"n] be the ring of polynomials with complex coefficients and A"n the Weyl algebra of order n over C. Elements in A"n are linear differential operators with polynomial coefficients. For each polynomial f, the ring M=C[x]"f of rational ...
Comments