Author： Collart S. Kalkbrener M. Mall D.
Publisher： Academic Press
ISSN： 0747-7171
Source： Journal of Symbolic Computation, Vol.24, Iss.3, 1997-09, pp. : 465-469
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
We present an algorithm which converts a given Grobner basisof a polynomial ideal I to a Grobner basis of I with respectto another term order. The conversion is done in several stepsfollowing a path in the Grobner fan of I. Each conversionstep is based on the computation of a Grobner basis of atoric degeneration of I.
Related content
Canonical comprehensive Grobner bases
Journal of Symbolic Computation, Vol. 36, Iss. 3, 2003-09 ,pp. :
Access to resources
Recommend
Grobner bases and wavelet design
Journal of Symbolic Computation, Vol. 37, Iss. 2, 2004-02 ,pp. :
On the Stability of Grobner Bases Under Specializations
Journal of Symbolic Computation, Vol. 24, Iss. 1, 1997-07 ,pp. :
An alternative approach to comprehensive Grobner bases
Journal of Symbolic Computation, Vol. 36, Iss. 3, 2003-09 ,pp. :
Polynomial ideals for sandpiles and their Grobner bases
Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. :