Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · math/0509544

Computing Groebner Fans

Komei Fukuda·Anders N. Jensen·Rekha R. Thomas
View original source ↗Read source document ↗Export metadata ↓

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.

Explore related subjects

math.ACmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Komei Fukuda, Anders N. Jensen, Rekha R. Thomas. 2005-09-23. Computing Groebner Fans. https://doi.org/10.1090/s0025-5718-07-01986-2

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Homology with the theme of Matlis

Matlis proved a lot of homological properties of the fraction field of an integral domain. In this paper, we simplify and extend some of them from 1-dimensional (resp. rank one) cases to the higher dimensional (resp. finite rank) cases. For example, we study the weakly co-torsion property of Ext$(-,\sim)$, and use it to present splitting criteria. These are equipped with several applications. For instance, we compute the projective dimension of $\widehat{R}$ and present some non-noetherian versions of Grothendieck's localization problem. We construct a new class of co-Hopfian modules and extend Matlis' decomposability problem to higher ranks. In particular, this paper deals with the basic properties of Matlis' quadric $(Q,Q/R, \widehat{R},\overset{\sim}R).$

math.AC↗
arXiv2026

Descent along flat composed with radicalization

We study the following general situation. Let $R\to S$ be a finite flat morphism of regular rings of zero (resp. prime) mixed or (equi)-characteristic. For $P\in Spec R$, put $A=R/P, C=S/PS,$ and $B=S/\sqrt{PS}=C_{\mathrm{red}}.$ The basic question is whether a property of $B$ forces the same property of $A$. The main point is that ordinary finite-flat descent applies naturally to $A\to C$, whereas the passage $C\to C_{\mathrm{red}}$ may (not) destroy nilpotent information.

math.AC↗
arXiv2026

When Hilbert functions determine generic initial ideals

Over a field of characteristic zero, we characterize the Hilbert functions that determine the degree reverse lexicographic generic initial ideal among Artinian quotients of embedding dimension $n\ge2$ with the $(n-2)$-strong Lefschetz property. The criterion is a finite arithmetic test on successive positive differences of the Hilbert function. It uses recursively defined integer vectors and requires no construction of a monomial ideal. When uniqueness holds, the same vectors recover the common generic initial ideal degree by degree. The proof reduces uniqueness successively to uniqueness of lower sets of specified cardinalities in Borel orders. In four variables, the test simplifies to avoidance of explicitly computed integer intervals. We recover the quasi-symmetry criterion of Harima and Wachi and give infinite families beyond that criterion in every number of variables at least four.

math.AC↗