Sparse systems and algorithmic equidimensional decomposition

DOI10.1007/S00200-025-00721-6MaRDI QIDQ7230641zbMATH OpenFDO

Authors María Isabel Herrero, Gabriela Jeronimo, Juan Sabia

Publication date 20 April 2026

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00200-025-00721-6

zbMATH Keywords

complexitydeformationsequidimensional decomposition of algebraic varietiesmixed volumessparse polynomial systemssymbolic algorithms

Mathematics Subject Classification ID

Solving polynomial systems; resultants (13P15) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Symbolic computation and algebraic computation (68W30)

Cites work

• A Direttissimo Algorithm for Equidimensional Decomposition
• A Gröbner free alternative for polynomial system solving
• A Polyhedral Method for Solving Sparse Polynomial Systems
• Affine solution sets of sparse polynomial systems
• Bernstein's theorem in affine space
• Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
• Computing isolated roots of sparse polynomial systems in affine space
• Computing parametric geometric resolutions
• Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
• Definability and fast quantifier elimination in algebraically closed fields
• Deformation techniques for efficient polynomial equation solving.
• Deformation techniques for sparse systems
• Dynamic enumeration of all mixed cells
• Effective equidimensional decomposition of affine varieties
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• General witness sets for numerical algebraic geometry
• Grundzüge einer arithmetischen Theorie der algebraischen Grössen. (Festschrift zu Herrn Ernst Eduard Kummers fünfzigjährigem Doctor-Jubiläum, 10 September 1881)
• Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
• How to count efficiently all affine roots of a polynomial system
• scientific article; zbMATH DE number 16651 (Why is no real title available?)
• scientific article; zbMATH DE number 481965 (Why is no real title available?)
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• scientific article; zbMATH DE number 2051430 (Why is no real title available?)
• scientific article; zbMATH DE number 806915 (Why is no real title available?)
• Modern computer algebra
• Newton polyhedra and toroidal varieties
• Newton polytopes and the Bezout theorem
• Numerically solving polynomial systems with Bertini
• On the complexity exponent of polynomial system solving
• Solving decomposable sparse systems
• Solving polynomial systems via homotopy continuation and monodromy
• Straight-line programs in geometric elimination theory
• The BKK root count in $\mathbf {C}^n$
• The computational complexity of the Chow form
• The number of roots of a system of equations
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Using Algebraic Geometry

This page was built for publication: Sparse systems and algorithmic equidimensional decomposition

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