Computing the primary decomposition of zero-dimensional ideals

DOI10.1006/JSCO.2002.0571zbMATH Open1010.13017OpenAlexW2087585092MaRDI QIDQ1864896FDOQ1864896

Authors: Chris Monico 

Publication date: 23 March 2003

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.2002.0571

Recommendations

• Primary decomposition of zero-dimensional ideals over finite fields
• Gröbner bases and primary decomposition of polynomial ideals
• scientific article; zbMATH DE number 1383108
• On general primary decomposition for zero-dimensional ideals
• Evaluation techniques for zero-dimensional primary decomposition

zbMATH Keywords

primary decomposition of idealGröbner basis

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Ideals and multiplicative ideal theory in commutative rings (13A15)

Cites Work

• Direct methods for primary decomposition
• Title not available (Why is that?)
• Factoring polynomials with rational coefficients
• Title not available (Why is that?)
• Title not available (Why is that?)
• Gröbner bases and primary decomposition of polynomial ideals
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (22)

• Title not available (Why is that?)
• Computation of the decomposition group of a triangular ideal
• Deterministic normal position transformation and its applications
• Computational Methods for the Construction of a Class of Noetherian Operators
• On the structure of ideals in a family of skew polynomial rings
• On inverse systems and squarefree decomposition of zero-dimensional polynomial ideals
• Computing PUR of zero-dimensional ideals of breadth at most one
• Direct methods for primary decomposition
• Primary decomposition of zero-dimensional ideals over finite fields
• Parallelization of modular algorithms
• Evaluation techniques for zero-dimensional primary decomposition
• Normal projection: deterministic and probabilistic algorithms
• An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
• Gröbner bases and primary decomposition of polynomial ideals
• The decision of prime and primary ideal
• On the primary decomposition of some determinantal hyperedge ideal
• Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
• An efficient algorithm for factoring polynomials over algebraic extension field
• On general primary decomposition for zero-dimensional ideals
• Algorithms for zero-dimensional ideals using linear recurrent sequences
• A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals
• Computing zero-dimensional schemes

This page was built for publication: Computing the primary decomposition of zero-dimensional ideals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864896)