Abstract
Let k[x 1, …, x n ] be a polynomial ring in n variables, and let I ⊂ k[x 1, …, x n ] be a homogeneous binomial ideal. We describe a fast algorithm to compute the saturation, I:(x 1 ⋯ x n ) ∞ . 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Biase, F.D., Urbanke, R.: An algorithm to calculate the kernel of certain polynomial ring homomorphisms. Experimental Mathematics 4, 227–234 (1995)
Bigatti, A.M., Scala, R., Robbiano, L.: Computing toric ideals. J. Symb. Comput. 27(4), 351–365 (1999)
Conti, P., Traverso, C.: Büchberger algorithm and integer programming. In: AAECC, pp. 130–139 (1991)
Cox, D.A., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics). Springer-Verlag New York, Inc., Secaucus (2007)
Eisenbud, D., Sturmfels, B.: Binomial ideals. Duke Mathematical Journal 84(1), 1–45 (1996)
Hemmecke, R., Malkin, P.N.: Computing generating sets of lattice ideals and markov bases of lattices. Journal of Symbolic Computation 44(10), 1463–1476 (2009)
Kesh, D., Mehta, S.K.: Generalized reduction to compute toric ideals. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 483–492. Springer, Heidelberg (2009)
Sturmfels, B.: Gröbner Bases and Convex Polytopes. University Lecture Series, vol. 8. American Mathematical Society, Providence (December 1995)
Tayur, S.R., Thomas, R.R., Natraj, N.R.: An algebraic geometry algorithm for scheduling in the presence of setups and correlated demands. Mathematical Programming 69(3), 369–401 (1995)
Thomas, R.R., Weismantel, R.: Truncated Gröbner bases for integer programming. In: Engineering, Communication and Computing, pp. 241–257. Kluwer Academic Publishers, Dordrecht (1995)
Urbaniak, R., Weismantel, R., Ziegler, G.M.: A variant of the Büchberger algorithm for integer programming. SIAM J. Discret. Math. 10(1), 96–108 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kesh, D., Mehta, S.K. (2011). A Saturation Algorithm for Homogeneous Binomial Ideals. In: Wang, W., Zhu, X., Du, DZ. (eds) Combinatorial Optimization and Applications. COCOA 2011. Lecture Notes in Computer Science, vol 6831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22616-8_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-22616-8_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22615-1
Online ISBN: 978-3-642-22616-8
eBook Packages: Computer ScienceComputer Science (R0)