Direct methods for primary decomposition (Q1209132)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Direct methods for primary decomposition
scientific article

    Statements

    Direct methods for primary decomposition (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 May 1993
    0 references
    Let \(I\) be an ideal in a polynomial ring \(S=k[x_ 1,\dots,x_ n]\) over a field \(k\). This paper gives new methods for computing the equidimensional parts of \(I\); the radical of \(I\), the localization of \(I\) at an ideal \(J\), and the primary decomposition of \(I\). These methods are based on ideas of modern commutative algebra and avoid the use of generic projections used by Hermann (1926) and all others. These techniques extend to arbitrary ideal operations previously only possible for principal ideals. Most of these results are stated for modules and it is usually assumed that \(k\) is a perfect field. Explicit algorithms are given for solving these problems computationally and they have been implemented in the computer algebra system Macaulay of Bayer and Stillman.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    ideal in a polynomial ring
    0 references
    radical
    0 references
    primary decomposition
    0 references
    computer algebra
    0 references
    Macaulay
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references