The Canny-Emiris conjecture for the sparse resultant
From MaRDI portal
Publication:6101263
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.
Recommendations
- Sparse resultant under vanishing coefficients
- Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants
- Subdivisions for macaulay formulas of sparse systems
- Sparse resultants and straight-line programs
- Macaulay style formulas for sparse resultants
- scientific article; zbMATH DE number 503188
- A subdivision-based algorithm for the sparse resultant
- Techniques for exploiting structure in matrix formulae of the sparse resultant
- Matrices in elimination theory
- Sparse resultant of composed polynomials. I: Mixed-unmixed case.
Cites work
- scientific article; zbMATH DE number 1263401 (Why is no real title available?)
- scientific article; zbMATH DE number 503188 (Why is no real title available?)
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 708653 (Why is no real title available?)
- scientific article; zbMATH DE number 939816 (Why is no real title available?)
- scientific article; zbMATH DE number 960150 (Why is no real title available?)
- A Poisson formula for the sparse resultant
- A Polyhedral Method for Solving Sparse Polynomial Systems
- A refinement of the Bernštein-Kušnirenko estimate
- A subdivision-based algorithm for the sparse resultant
- Bilinear Systems with Two Supports
- Deformation techniques for sparse systems
- Exact matrix formula for the unmixed resultant in three variables
- HAUTEUR NORMALISÉE DES VARIÉTÉS TORIQUES PROJECTIVES
- Inertia forms and resultant: A formulary
- Macaulay style formulas for sparse resultants
- Matrices in elimination theory
- Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomials
- Multigraded resultants of Sylvester type
- Multihomogeneous resultant formulae by means of complexes
- Multilinear polynomial systems: root isolation and bit complexity
- Newton polyhedra of discriminants of projections
- On the Newton polytope of the resultant
- On the existence of mixed fiber bodies
- Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants
- Solving polynomial equations. Foundations, algorithms, and applications
- Sparse resultant under vanishing coefficients
- Sparse resultants and straight-line programs
- Subdivisions for macaulay formulas of sparse systems
- The number of roots of a system of equations
- The resultant of an unmixed bivariate system
- Théoremes de Bertini et applications
- Using Algebraic Geometry
This page was built for publication: The Canny-Emiris conjecture for the sparse resultant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6101263)
