✦ LIBER ✦

Algorithms for the Quillen-Suslin theorem

✍ Scribed by Alessandro Logar; Bernd Sturmfels

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 426 KB
Volume: 145
Category: Article
ISSN: 0021-8693
DOI: 10.1016/0021-8693(92)90189-s

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.

Two examples of the Bass-Quillen-Suslin

Two examples of the Bass-Quillen-Suslin Conjectures

✍ Ravi A. Rao 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 675 KB

An Algorithmic Proof of Suslin′s Stabili

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

✍ H.J. Park; C. Woodburn 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 712 KB

A reduction theorem for normal algorithm

A reduction theorem for normal algorithms

✍ R. M. Baer 📂 Article 📅 1969 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

Efficient Algorithms for Petersen's Matc

Efficient Algorithms for Petersen's Matching Theorem

✍ Therese C. Biedl; Prosenjit Bose; Erik D. Demaine; Anna Lubiw 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 293 KB

Petersen's theorem is a classic result in matching theory from 1891, stating that every 3-regular bridgeless graph has a perfect matching. Our work explores efficient algorithms for finding perfect matchings in such graphs. Previously, the only relevant matching algorithms were for general graphs, a

An acceleration theorem for the ρ-algori

An acceleration theorem for the ρ-algorithm

✍ Naoki Osada 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 102 KB