The Canny-Emiris conjecture for the sparse resultant

DOI10.1007/S10208-021-09547-3zbMATH Open1516.13029arXiv2004.14622WikidataQ113904740 ScholiaQ113904740MaRDI QIDQ6101263FDOQ6101263

Authors: Carlos D'Andrea, Gabriela Jeronimo, Martín Sombra 

Publication date: 20 June 2023

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2004.14622

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.

zbMATH Keywords

initial partmixed subdivisionsparse resultantMacaulay formula

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Solving polynomial systems; resultants (13P15)

Cites Work

• Title not available (Why is that?)
• Using Algebraic Geometry
• Title not available (Why is that?)
• Inertia forms and resultant: A formulary
• Théoremes de Bertini et applications
• On the Newton polytope of the resultant
• A refinement of the Bernštein-Kušnirenko estimate
• A Polyhedral Method for Solving Sparse Polynomial Systems
• The number of roots of a system of equations
• A Poisson formula for the sparse resultant
• Newton polyhedra of discriminants of projections
• Solving polynomial equations. Foundations, algorithms, and applications
• Title not available (Why is that?)
• Macaulay style formulas for sparse resultants
• A subdivision-based algorithm for the sparse resultant
• Deformation techniques for sparse systems
• Matrices in elimination theory
• Multihomogeneous resultant formulae by means of complexes
• Title not available (Why is that?)
• Multigraded resultants of Sylvester type
• Sparse resultant under vanishing coefficients
• The resultant of an unmixed bivariate system
• Subdivisions for macaulay formulas of sparse systems
• Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants
• HAUTEUR NORMALISÉE DES VARIÉTÉS TORIQUES PROJECTIVES
• On the existence of mixed fiber bodies
• Title not available (Why is that?)
• Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomials
• Sparse resultants and straight-line programs
• Exact matrix formula for the unmixed resultant in three variables
• Title not available (Why is that?)
• Multilinear polynomial systems: root isolation and bit complexity
• Bilinear Systems with Two Supports

Cited In (1)

• Mixed subdivisions suitable for the greedy Canny-Emiris formula

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)