✦ LIBER ✦

An algorithm for primary decomposition in polynomial rings over the integers

✍ Scribed by Gerhard Pfister; Afshan Sadiq; Stefan Steidel

Book ID: 111488723
Publisher: SP Versita
Year: 2011
Tongue: English
Weight: 369 KB
Volume: 9
Category: Article
ISSN: 1895-1074
DOI: 10.2478/s11533-011-0037-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for primary decomposition i

An algorithm for primary decomposition in polynomial rings over the integers

✍ Gerhard Pfister; Afshan Sadiq; Stefan Steidel 📂 Article 📅 2011 🏛 SP Versita 🌐 English ⚖ 369 KB

An algorithm for unimodular completion o

An algorithm for unimodular completion over Laurent polynomial rings

✍ Morou Amidou; Ihsen Yengui 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 150 KB

The decomposition theorem for ideals in

The decomposition theorem for ideals in polynomial rings over a domain

✍ Christine W Ayoub 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 598 KB

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

Fast algorithms for computing one- and t

Fast algorithms for computing one- and two-dimensional convolution in integer polynomial rings

✍ H. Krishna Garg; C. C. Ko 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 871 KB

Algorithm for calculating the roots of p

Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain

✍ A. É. Maevskii 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 717 KB