论文信息 - ON SuperG-BASES*

ON SuperG-BASES*

In this paper we introduce the notion of SuperG-basis. It is a finite set of polynomials such that every subset is a Grobner basis with respect to a given term-ordering. We study SuperG-bases from a theoretical point of view and we device procedures for constructing them, starting with a given set of terms. We show some applications to families of ideals and to the problem of lifting.

Lorenzo Robbiano | L. Robbiano | Giuseppa Carra’-Ferro | Giuseppa Carra’-Ferro

[1] M. Roitman. On the lifting problem for homogeneous ideals in polynomial rings , 1988 .

[2] Giuseppa Carrà Ferro. Gröbner Bases and Hilbert Schemes. I , 1988, J. Symb. Comput..

[3] B. Buchberger,et al. Grobner Bases : An Algorithmic Method in Polynomial Ideal Theory , 1985 .

[4] Lorenzo Robbiano,et al. On the Theory of Graded Structures , 1986, J. Symb. Comput..

[5] Bruno Buchberger,et al. A criterion for detecting unnecessary reductions in the construction of Groebner bases , 1979, EUROSAM.

[6] D. Gregory,et al. Monomial ideals and points in projective space , 1986 .

[7] Robin Hartshorne,et al. Connectedness of the Hilbert scheme , 1966 .