An algorithm for the computation of the radical of an ideal

DOI10.1145/1145768.1145802MaRDI QIDQ2958987zbMATH OpenOpenAlexFDO

Authors Santiago Laplagne

Publication date 3 February 2017

Published in Proceedings of the 2006 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1145768.1145802

zbMATH Keywords

algorithmscomplexitypolynomial idealprimary decompositionradical

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 177873
• An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
• scientific article; zbMATH DE number 1057741
• Computing the radical of an ideal in positive characteristic
• On radical zero-dimensional ideals

Cited in

(26)

• A prolongation-projection algorithm for computing the finite real variety of an ideal
• Radical computations of zero-dimensional ideals and real root counting.
• Complexity of triangular representations of algebraic sets
• Moment matrices, border bases and real radical computation
• Effective differential Nullstellensatz for ordinary DAE systems with constant coefficients
• A symbolic algorithm for parameterizing a prime ideal
• Effective Computation of Radical of Ideals and Its Application to Invariant Theory
• Approximate radical of ideals with clusters of roots (extended abstract)
• scientific article; zbMATH DE number 5990116 (Why is no real title available?)
• Forward analysis for WSTS, part I: completions
• scientific article; zbMATH DE number 5375015 (Why is no real title available?)
• A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals
• Combined Decision Techniques for the Existential Theory of the Reals
• Radical computation for small characteristics
• scientific article; zbMATH DE number 177873 (Why is no real title available?)
• Complexity of membership problems of different types of polynomial ideals
• An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
• A new algorithm for computing regular representations for radicals of parametric differential ideals
• LOCAL ANALYSIS OF GRAUERT–REMMERT-TYPE NORMALIZATION ALGORITHMS
• Zero counting and invariant sets of differential equations
• Computing the radical of an ideal in positive characteristic
• Segre-driven radicality testing
• Rationality and parametrizations of algebraic curves under specializations
• A decision method for the integrability of differential-algebraic Pfaffian systems
• Effective uniform bounding in partial differential fields
• On decomposition of algebraic PDE systems into simple subsystems

This page was built for publication: An algorithm for the computation of the radical of an ideal

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