✦ LIBER ✦

Computation of the Decomposition Group of a Triangular Ideal

✍ Scribed by I. Abdeljaouad-Tej; S. Orange; G. Renault; A. Valibouze

Book ID: 105867416
Publisher: Springer
Year: 2004
Tongue: English
Weight: 259 KB
Volume: 15
Category: Article
ISSN: 0938-1279
DOI: 10.1007/s00200-004-0160-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing the Primary Decomposition of Z

Computing the Primary Decomposition of Zero-dimensional Ideals

✍ Chris Monico 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Let K be an infinite perfect computable field and let I ⊆ K[x] be a zero-dimensional ideal represented by a Gröbner basis. We derive a new algorithm for computing the reduced primary decomposition of I using only standard linear algebra and univariate polynomial factorization techniques. In practice

Algorithms for computing triangular deco

Algorithms for computing triangular decomposition of polynomial systems

✍ Changbo Chen; Marc Moreno Maza 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 419 KB

Decomposition of the Augmentation Ideal

Decomposition of the Augmentation Ideal and of the Relation Modules of a Finite Group

✍ Gruenberg, K. W.; Roggenkamp, K. W. 📂 Article 📅 1975 🏛 Oxford University Press 🌐 English ⚖ 443 KB

Idealization of a decomposition theorem

✍ A. Keskin; T. Noiri; Ş Yüksel 📂 Article 📅 2004 🏛 Akadmiai Kiad 🌐 English ⚖ 215 KB

The group inverse of a triangular matrix

✍ Xuzhou Chen; Robert E Hartwig 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 364 KB

A decomposition of continuity via ideals

✍ V. Renuka Devi; D. Sivaraj 📂 Article 📅 2007 🏛 Akadmiai Kiad 🌐 English ⚖ 253 KB