Elimination for Generic Sparse Polynomial Systems

Discrete & Computational Geometry, Jan 2014

We present a new probabilistic symbolic algorithm that, given a variety defined in an n-dimensional affine space by a generic sparse system with fixed supports, computes the Zariski closure of its projection to an ℓ-dimensional coordinate affine space with ℓ<n. The complexity of the algorithm depends polynomially on some combinatorial invariants associated to the supports.

This is a preview of a remote PDF: https://link.springer.com/content/pdf/10.1007%2Fs00454-014-9571-z.pdf

María Isabel Herrero, Gabriela Jeronimo, Juan Sabia. Elimination for Generic Sparse Polynomial Systems, Discrete & Computational Geometry, 2014, 578-599, DOI: 10.1007/s00454-014-9571-z