𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for unimodular completion over Laurent polynomial rings

✍ Scribed by Morou Amidou; Ihsen Yengui

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
150 KB
Volume
429
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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.