arXiv · 2505.08097
Sparse systems and algorithmic equidimensional decomposition
Abstract
We present a new probabilistic algorithm that characterizes the equidimensional components of the affine algebraic variety defined by an arbitrary sparse polynomial system with prescribed supports. For each equidimensional component, the algorithm computes a witness set, namely a finite set obtained by intersecting the component with a generic linear variety of complementary dimension. The complexity of the algorithm is polynomial in combinatorial invariants associated to the supports of the polynomials involved.
Explore related subjects
Keep this discovery
Maria Isabel Herrero, Gabriela Jeronimo, Juan Sabia. 2025-05-12. Sparse systems and algorithmic equidimensional decomposition. https://arxiv.org/abs/2505.08097
Cite the original work for its findings. Save a collection to share your selection of sources.