Computing Groebner Fans

Details Computing Groebner Fans Computing Groebner Fans

2005-09-23

arxiv.org/abs/math/0509544v1

Math. Comp. 76 (2007), 2189-2212

Mathematics

Commutative Algebra

26 pages

Scientific paper

10.1090/S0025-5718-07-01986-2

This paper presents algorithms for computing the Groebner fan of an arbitrary polynomial ideal. The computation involves enumeration of all reduced Groebner bases of the ideal. Our algorithms are based on a uniform definition of the Groebner fan that applies to both homogeneous and non-homogeneous ideals and a proof that this object is a polyhedral complex. We show that the cells of a Groebner fan can easily be oriented acyclically and with a unique sink, allowing their enumeration by the memory-less reverse search procedure. The significance of this follows from the fact that Groebner fans are not always normal fans of polyhedra in which case reverse search applies automatically. Computational results using our implementation of these algorithms in the software package Gfan are included.

Affiliated with

Also associated with

No associations

Rating

Computing Groebner Fans does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing Groebner Fans, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Groebner Fans will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-71239