Solving systems of nonlinear polynomial equations faster
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Multipolynomial resultant algorithms
Journal of Symbolic Computation
On the Newton Polytope of the Resultant
Journal of Algebraic Combinatorics: An International Journal
Sparsity considerations in Dixon resultants
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Extraneous factors in the Dixon resultant formulation
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
The structure of sparse resultant matrices
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Solving degenerate sparse polynomial systems faster
Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Solving the recognition problem for six lines using the Dixon resultant
Mathematics and Computers in Simulation - Special issue on high performance symbolic computing
A subdivision-based algorithm for the sparse resultant
Journal of the ACM (JACM)
Generalized resultants over unirational algebraic varieties
Journal of Symbolic Computation - Special issue on symbolic computation in algebra, analysis and geometry
Sparse resultant of composed polynomials I* mixed-unmixed case
Journal of Symbolic Computation
Dense resultant of composed polynomials mixed-mixed case
Journal of Symbolic Computation
Factoring sparse resultants of linearly combined polynomials
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Resultants of skewly composed polynomials
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Computing multihomogeneous resultants using straight-line programs
Journal of Symbolic Computation
Cayley-Dixon projection operator for multi-univariate composed polynomials
Journal of Symbolic Computation
A parametric representation of totally mixed Nash equilibria
Computers & Mathematics with Applications
Resultants of partially composed polynomials
Journal of Symbolic Computation
Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants
Journal of Symbolic Computation
Hi-index | 0.00 |
The main question of this paper is: What happens to the sparse (toric) resultant under vanishing coefficients? More precisely, let f1,…,fn be sparse Laurent polynomials with supports \cal A1,…,\cal An and let \tilde{\cal A}1 ⊃ \cal A1. Naturally a question arises: Is the sparse resultant of f1,f2,…,fn with respect to the supports \tilde{\cal A}1,\cal A2,…,\cal An in any way related to the sparse resultant of f1,f2,…,fn with respect to the supports \cal A1,\cal A2,…,\cal An? The main contribution of this paper is to provide an answer. The answer is important for applications with perturbed data where very small coefficients arise as well as when one computes resultants with respect to some fixed supports, not necessarily the supports of the fi's, in order to speed up computations. This work extends some work by Sturmfels on sparse resultant under vanishing coefficients. We also state a corollary on the sparse resultant under powering of variables which generalizes a theorem for Dixon resultant by Kapur and Saxena. We also state a lemma of independent interest generalizing Pedersen's and Sturmfels' Poisson-type product formula.