A Poisson formula for the sparse resultant
From MaRDI portal
Publication:5248613
DOI10.1112/plms/pdu069zbMath1349.14160arXiv1310.6617OpenAlexW3102975038MaRDI QIDQ5248613
Martín Sombra, Carlos D'Andrea
Publication date: 8 May 2015
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.6617
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Solving polynomial systems; resultants (13P15)
Related Items (17)
A package for computations with sparse resultants ⋮ Multivariate Abel-Ruffini ⋮ Improving root separation bounds ⋮ Overdetermined systems of equations on toric, spherical, and other algebraic varieties ⋮ Subresultants and the Shape Lemma ⋮ Contour Integration for Eigenvector Nonlinearities ⋮ Sparse resultants and straight-line programs ⋮ The Canny-Emiris conjecture for the sparse resultant ⋮ Sparse trace tests ⋮ Zero distribution of random Bernoulli polynomial mappings ⋮ Koszul-Type Determinantal Formulas for Families of Mixed Multilinear Systems ⋮ Sparse versions of the Cayley-Bacharach theorem ⋮ Solving Polynomial Systems via Truncated Normal Forms ⋮ Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomials ⋮ Hyperdeterminants from the \(E_8\) discriminant ⋮ Sparse polynomial equations and other enumerative problems whose Galois groups are wreath products ⋮ Sparse differential resultant for Laurent differential polynomials
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A refinement of the Bernštein-Kušnirenko estimate
- Newton polyhedra of discriminants of projections
- Deformation techniques for sparse systems
- On the Newton polytope of the resultant
- Product formulas for resultants and Chow forms
- Sparse resultant under vanishing coefficients
- Solving polynomial equations. Foundations, algorithms, and applications
- The computational complexity of the Chow form
- Macaulay style formulas for sparse resultants
- Heights of varieties in multiprojective spaces and arithmetic Nullstellensatze
- Quantitative Equidistribution for the Solutions of Systems of Sparse Polynomial Equations
- Introduction to Toric Varieties. (AM-131)
- Residues and Resultants
- The height of the mixed sparse resultant
- A subdivision-based algorithm for the sparse resultant
This page was built for publication: A Poisson formula for the sparse resultant