An algorithm for computing a Gröbner basis of a polynomial ideal over a ring with zero divisors

DOI10.1007/s11786-009-0072-zzbMath1205.13032OpenAlexW2123108892MaRDI QIDQ626888

Yongyang Cai, Deepak Kapur

Publication date: 19 February 2011

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-009-0072-z

zbMATH Keywords

Gröbner basisalgebraic geometrycanonical formideal membershippolynomial idealring with zero divisors

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Related Items (7)

GRÖBNER-SHIRSHOV BASIS FOR MONOMIALS SEMIRING OVER D-A RINGS ⋮ Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties ⋮ Some improvements for the algorithm of Gröbner bases over dual valuation domain ⋮ Efficient Gröbner bases computation over principal ideal rings ⋮ Semi-ring Based Gröbner–Shirshov Bases over a Noetherian Valuation Ring ⋮ Noncommutative Gröbner Basis over a Divisible and Annihilable Ring ⋮ Relative Gröbner and involutive bases for ideals in quotient rings

This page was built for publication: An algorithm for computing a Gröbner basis of a polynomial ideal over a ring with zero divisors