Segre-driven radicality testing

DOI10.1016/j.jsc.2023.102262arXiv2110.01913OpenAlexW3203066441MaRDI QIDQ6184180

Martin Helmer, Elias P. Tsigaridas

Publication date: 5 January 2024

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

Full work available at URL: https://arxiv.org/abs/2110.01913

zbMATH Keywords

rational univariate representationintersection theorySegre classradical idealsequidimensional decompositiontesting if a polynomial ideal is radical

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Computational aspects in algebraic geometry (14Qxx) Computational aspects and applications of commutative rings (13Pxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
• Localization and primary decomposition of polynomial ideals
• Generalised characteristic polynomials
• Evaluation techniques for zero-dimensional primary decomposition
• Gröbner bases and primary decomposition of polynomial ideals
• On the complexity of computing syzygies
• Direct methods for primary decomposition
• Solving zero-dimensional systems through the rational univariate representation
• Effective equidimensional decomposition of affine varieties
• Solving degenerate sparse polynomial systems faster
• The complexity of the word problems for commutative semigroups and polynomial ideals
• The computational complexity of the Chow form
• A direct algorithm to compute the topological Euler characteristic and Chern-Schwartz-MacPherson class of projective complete intersection varieties
• Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
• A concise proof of the Kronecker polynomial system solver from scratch
• On the complexity exponent of polynomial system solving
• Modern Computer Algebra
• An algorithm for the computation of the radical of an ideal
• Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
• Algorithm 795
• Sparse Rational Univariate Representation
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Probabilistic Saturations and Alt’s Problem

This page was built for publication: Segre-driven radicality testing