The Canny-Emiris conjecture for the sparse resultant
Preprint
Abstract
We present a product formula for the initial parts of the sparse resultant associated to an arbitrary family of supports, generalising a previous result by Sturmfels. This allows to compute the homogeneities and degrees of the sparse resultant, and its evaluation at systems of Laurent polynomials with smaller supports. We obtain a similar product formula for some of the initial parts of the principal minors of the Sylvester-type square matrix associated to a mixed subdivision of a polytope. Applying these results, we prove that the sparse resultant can be computed as the quotient of the determinant of such a square matrix by a certain principal minor, under suitable hypothesis. This generalises the classical Macaulay formula for the homogeneous resultant, and confirms a conjecture of Canny and Emiris.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Multilinear polynomial systems: Root isolation and bit complexityJournal of Symbolic Computation, 2021
- Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomialsJournal of Symbolic Computation, 2020
- Sparse resultants and straight-line programsJournal of Symbolic Computation, 2018
- Deformation Techniques for Sparse SystemsFoundations of Computational Mathematics, 2008
- The resultant of an unmixed bivariate systemJournal of Symbolic Computation, 2003
- Multihomogeneous resultant formulae by means of complexesJournal of Symbolic Computation, 2003
- Matrices in Elimination TheoryJournal of Symbolic Computation, 1999
- Combinatorial Convexity and Algebraic Geometry1996
- Multigraded Resultants of Sylvester TypeJournal of Algebra, 1994
- Discriminants, Resultants, and Multidimensional Determinants1994