Elimination for generic sparse polynomial systems

2013/03/01 by María Isabel Herrero, Herrero, María Isabel, Gabriela Jeronimo +3
Computer Science · Mathematics · #14Q20 #Algebraic Geometry (math.AG) #Commutative Algebra (math.AC) #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #Symbolic Computation (cs.SC) #cs.CC #cs.SC #math.AC #math.AG #msc:14Q20

paper · pdf · doi:10.48550/arxiv.1303.0266

22 pages

arxiv created 2014/01/23 · arxiv updated 2014/01/24

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.

Related

• Sparse systems and algorithmic equidimensional decomposition
• Deformation techniques for sparse systems
• Affine solution sets of sparse polynomial systems
• Polynomial Invariants for Affine Programs
• A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set