publication . Preprint . 2005

Truncated Groebner fans and lattice ideals

Lauritzen, Niels;
Open Access English
  • Published: 11 Sep 2005
We outline a generalization of the Groebner fan of a homogeneous ideal with maximal cells parametrizing truncated Groebner bases. This "truncated" Groebner fan is usually much smaller than the full Groebner fan and offers the natural framework for conversion between truncated Groebner bases. The generic Groebner walk generalizes naturally to this setting by using the Buchberger algorithm with truncation on facets. We specialize to the setting of lattice ideals. Here facets along the generic walk are given by unique (facet) binomials. This along with the representation of binomials as integer vectors give an especially simple version of the generic Groebner walk....
arXiv: Computer Science::Symbolic ComputationMathematics::Commutative AlgebraComputer Science::Mathematical Software
free text keywords: Mathematics - Commutative Algebra, Mathematics - Algebraic Geometry, Mathematics - Combinatorics, 13P10
Download from

[1] K. Aardal, A. Lenstra. Hard equality constrained integer knapsacks. Mathematics of Operations Research 29 (2004), 724-738.

[2] J. De Loera, D. Haws, R. Hemmecke, P. Huggins, R. Yoshida. Three integer programming algorithms based on Barvinok's rational functions. J. Symbolic Comp. 38 (2004), 1273 - 1302.

[3] K. Fukuda, A. Jensen, N. Lauritzen, R. Thomas. The generic Gro¨bner walk, math.AG/0501345.

[4] B. Huber, R. Thomas, Computing the Gro¨bner fan of a toric ideal, Exp. Math. 9 (2000), 321- 331.

[5] N. Lauritzen, Homogeneous Buchberger algorithms and Sullivant's computational commutative algebra challenge, math.AC/0508287.

[6] B. Sturmfels. Gro¨bner Bases and Convex Polytopes. University Lecture Series 8, Amer. Math. Soc., Providence, RI, 1996.

[7] R. Thomas and R. Weismantel, Truncated Gro¨bner bases for integer programming, AAEC 8 (1997), 241-256

Any information missing or wrong?Report an Issue