Elimination for generic sparse polynomial systems
- Herrero, Maria Isabel
- Jeronimo, Gabriela Tali
- Sabia, Juan Vicente Rafael
DOIAbstract
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.Fil: Herrero, Maria Isabel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Jeronimo, Gabriela Tali. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Inve...
Add to ORKG