A saturation algorithm for homogeneous binomial ideals

Authors:
Deepanjan Kesh;Shashank K. Mehta
Affiliations:
Indian Institute of Technology, Kanpur, India;Indian Institute of Technology, Kanpur, India
Venue:
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Year:
2011

Citing 7
Cited 0

An algebraic geometry algorithm for scheduling in presence of setups and correlated demands

Mathematical Programming: Series A and B
A Variant of the Buchberger Algorithm for Integer Programming

SIAM Journal on Discrete Mathematics
Computing toric ideals

Journal of Symbolic Computation
Buchberger Algorithm and Integer Programming

AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)

Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
Computing generating sets of lattice ideals and Markov bases of lattices

Journal of Symbolic Computation
Generalized Reduction to Compute Toric Ideals

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let k[x1, . . . ,xn] be a polynomial ring in n variables, and let I ⊂ k[x1, . . . , xn] be a homogeneous binomial ideal. We describe a fast algorithm to compute the saturation, I : (x1 ...xn)∞. In the special case when I is a toric ideal, we present some preliminary results comparing our algorithm with Project and Lift by Hemmecke and Malkin.