𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Algorithmic Proof of Suslin′s Stability Theorem for Polynomial Rings

✍ Scribed by H.J. Park; C. Woodburn

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
712 KB
Volume
178
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Algorithm for the Quillen–Suslin Theo
An Algorithm for the Quillen–Suslin Theorem for Quotients of Polynomial Rings by Monomial Ideals
✍ Reinhard Laubenbacher; Karen Schlauch 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 307 KB

This paper presents an algorithm for the Quillen-Suslin Theorem for quotients of polynomial rings by monomial ideals, that is, quotients of the form A = k[x 0 , . . . , xn]/I, with I a monomial ideal and k a field. Vorst proved that finitely generated projective modules over such algebras are free.

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