An Algorithm for Computing Minimal Associated Primes of Binomial Ideals without Producing Redundant Components

DOI10.1145/3087604.3087644zbMath1457.68322OpenAlexW2737390395MaRDI QIDQ5119917

Toru Aoyama

Publication date: 9 September 2020

Published in: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3087604.3087644

zbMATH Keywords

algorithmGröbner basispolynomial ringbinomial idealsminimal associated primescellular 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)

This page was built for publication: An Algorithm for Computing Minimal Associated Primes of Binomial Ideals without Producing Redundant Components