The Gröbner fan of an ideal (Q1117983): Difference between revisions

The starting point of this paper was the hope of understanding the effect of changing orderings to the computation of Gröbner bases of ideals in the polynomial ring. The first section deals with the problem of checking whether two arrays of real vectors give rise to the same ordering: this goal is achieved by theorem 1.6. --- Section~2 begins with the description of a suitable polyhedral cone associated to all the orderings for which a fixed finite set of vectors is positive. Polyhedral cones become then the main tool and the first main result is theorem 2.5. --- Section 3 is a technical interlude, which treats the homogenization of vectors and extension of orderings from \(\mathbb{Z}^ n\) to \(\mathbb{Z}^{n+1}\). The results of section 3 allow to see what happens to those orderings whose associated half-line is outside the Gröbner region G(I) in sections 4. -- In section 5 the authors focus their attention on the description of G(I) and they show that it describes the set of orderings, which behave with respect to I as term-orderings. --- The final section describes a prototype of a ``Buchberger parallel algorithm'', which yields the Gröbner fan and all the reduced Gröbner bases of a given ideal I.