A saturation algorithm for homogeneous binomial ideals

DOI10.1007/978-3-642-22616-8_28MaRDI QIDQ5199162zbMATH OpenOpenAlexFDO

Authors Deepanjan Kesh, Shashank K. Mehta

Publication date 12 August 2011

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.841.336

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Symbolic computation and algebraic computation (68W30)

Recommendations

• Computing toric ideals
• Some results on special binomial ideals
• Generalized reduction to compute toric ideals
• Binomial ideals
• Generalized reduction to compute toric ideals

Cited in

(6)

• Computing toric ideals
• On the computation of Bernstein-Sato ideals.
• The norm of the saturation of a binomial ideal, with applications to Markov bases
• scientific article; zbMATH DE number 5365720 (Why is no real title available?)
• Combinatorial excess intersection
• The saturation number of monomial ideals

This page was built for publication: A saturation algorithm for homogeneous binomial ideals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199162)