A divide and conquer method to compute binomial ideals

DOI10.1007/978-3-642-54423-1_56MaRDI QIDQ5405080zbMATH OpenOpenAlexFDO

Authors Deepanjan Kesh, Shashank K. Mehta

Publication date 31 March 2014

Published in LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-54423-1_56

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)

Recommendations

• Binomial ideals
• On monomial reduction and polynomial expressions with respect to binomial ideals
• An algorithm for computing minimal associated primes of binomial ideals without producing redundant components

Cited in

(3)

• Detecting binomiality
• Computing the binomial part of a polynomial ideal
• Decompositions of cellular binomial ideals

This page was built for publication: A divide and conquer method to compute binomial ideals

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