A saturation algorithm for homogeneous binomial ideals

DOI10.1007/978-3-642-22616-8_28zbMATH Open1342.68364OpenAlexW1685595413MaRDI QIDQ5199162FDOQ5199162

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

Recommendations

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) 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)

Cited In (5)

• The saturation number of monomial ideals
• The norm of the saturation of a binomial ideal, with applications to Markov bases
• Combinatorial excess intersection
• Title not available (Why is that?)
• On the computation of Bernstein-Sato 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)