Computing Gröbner fans

From MaRDI portal
Publication:3592702

DOI10.1090/S0025-5718-07-01986-2zbMATH Open1119.13026arXivmath/0509544OpenAlexW2142393549MaRDI QIDQ3592702FDOQ3592702


Authors: Komei Fukuda, Rekha Thomas, Anders Nedergaard Jensen Edit this on Wikidata


Publication date: 13 September 2007

Published in: Mathematics of Computation (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/math/0509544




Recommendations



Cites Work


Cited In (38)

Uses Software





This page was built for publication: Computing Gröbner fans

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3592702)