✦ LIBER ✦

Algorithmic Properties of Polynomial Rings

✍ Scribed by M. KALKBRENER

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 935 KB
Volume: 26
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.1998.0227

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we investigate how algorithms for computing heights, radicals, unmixed and primary decompositions of ideals can be lifted from a Noetherian commutative ring R to polynomial rings over R.

📜 SIMILAR VOLUMES

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

Cancellation Properties of Projective Mo

Cancellation Properties of Projective Modules over Laurent Polynomial Rings

✍ A. Wiemers 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 469 KB

Retracts of polynomial rings

✍ Douglas L Costa 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 732 KB

Hereditary localizations of polynomial r

Hereditary localizations of polynomial rings

✍ Sarah Glaz 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 693 KB

Rings of monoids elementarily equivalent

Rings of monoids elementarily equivalent to polynomial rings

✍ Gérard Leloup 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 512 KB

Cohen-Macaulay quotients of polynomial r

Cohen-Macaulay quotients of polynomial rings

✍ Gerald Allen Reisner 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 979 KB