𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Algorithm for Computing a Gröbner Basis of a Polynomial Ideal over a Ring with Zero Divisors

✍ Scribed by Deepak Kapur; Yongyang Cai

Book ID
107508897
Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
726 KB
Volume
2
Category
Article
ISSN
1661-8270

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Gröbner Basis Method for Modules over
A Gröbner Basis Method for Modules over Rings of Differential Operators
✍ Toshinori Oaku; Takeshi Shimoyama 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 683 KB

We study modules over the ring \(\mathcal{D}_{0}\) of differential operators with power series coeffcients. For \(\mathcal{D}_{0}\)-modules, we introduce a new notion of \(F\)-Gröbner basis and present an algorithmic method to compute it. Our method is more algebraic than that of Castro \((1986,1987

An algorithm for the divisors of monic p
An algorithm for the divisors of monic polynomials over a commutative ring
✍ Ihsen Yengui 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB

Gilmer and Heinzer proved that given a reduced ring R, a polynomial f divides a monic polynomial in R[X] if and only if there exists a direct sum decomposition of R = R0 ⊕ . . . ⊕ Rm (m ≤ deg f ), associated to a fundamental system of idempotents e0, . . . , em, such that the component of f in each