Elimination for generic sparse polynomial systems
Algebraic Geometry
2014-01-24 v3 Computational Complexity
Symbolic Computation
Commutative Algebra
Abstract
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 l-dimensional coordinate affine space with l < n. The complexity of the algorithm depends polynomially on combinatorial invariants associated to the supports.
Cite
@article{arxiv.1303.0266,
title = {Elimination for generic sparse polynomial systems},
author = {María Isabel Herrero and Gabriela Jeronimo and Juan Sabia},
journal= {arXiv preprint arXiv:1303.0266},
year = {2014}
}
Comments
22 pages