We present an efficient algorithm for the transformation of a Grobner basis of a zero-dimensional ideal with respect to any given ordering into a GroBner basis withrespect to any other ordering.Expand

To every ideal I in the polynomial ring A:=k[X"1,..., X"n] new invariants are attached, such as the Grobner Fan F(I), G(I) and ATO( I) of the almost term-orderings of I.Expand

Grobner bases are a finite model of an infinite linear Gauss-reduced basis of an ideal viewed as a vector space and Buchberger algorithm is the corresponding generalization of the Gaussian elimination algorithm for their computation.Expand

In this paper we study 0-dimensional polynomial ideals defined by a dual basis, i.e. as the set of polynomials which are in the kernel of a set of linear morphisms from the Polynomial ring to the base field.Expand

This paper deals with the description of the solutions of zero dimensional systems of polynomial equations. Based on different models for describing solutions, we consider suitable representations of… Expand