Truncated Groebner fans and lattice ideals

Preprint English OPEN
Lauritzen, Niels (2005)
  • Subject: Mathematics - Combinatorics | 13P10 | Mathematics - Commutative Algebra | Mathematics - Algebraic Geometry
    arxiv: Mathematics::Commutative Algebra | Computer Science::Symbolic Computation | Computer Science::Mathematical Software

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 tru... View more
  • References (7)

    [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

  • Metrics
    No metrics available
Share - Bookmark