On the Newton polytope of the resultant
From MaRDI portal
Publication:1321592
DOI10.1023/A:1022497624378zbMath0798.05074MaRDI QIDQ1321592
Publication date: 31 May 1994
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
resultantselimination theoryLaurent polynomialsNewton polytopesfiber polytopemixed subdivisionextreme monomialsmixed circuitsmixed polyhedral decompositionsparse mixed resultant
Related Items
A package for computations with sparse resultants, Do most polynomials generate a prime ideal?, Optimal Descartes' rule of signs for systems supported on circuits, A convex geometric approach to counting the roots of a polynomial system, Multivariate Abel-Ruffini, Determinantal singularities and Newton polyhedra, A zonotope and a product of two simplices with disconnected flip graphs, Counting isolated points outside the image of a polynomial map, On the Mahler measure of resultants in small dimensions, Mixed-volume computation by dynamic lifting applied to polynomial system solving, Dissections, Hom-complexes and the Cayley trick, Implicitization of curves and (hyper)surfaces using predicted support, Overdetermined systems of equations on toric, spherical, and other algebraic varieties, Linear sparse differential resultant formulas, Supertropical polynomials and resultants, A polyhedral homotopy algorithm for real zeros, The Tropical Nullstellensatz and Positivstellensatz for Sparse Polynomial Systems, Landau discriminants, Contour Integration for Eigenvector Nonlinearities, Sparse resultants and straight-line programs, The Canny-Emiris conjecture for the sparse resultant, Differential elimination by differential specialization of Sylvester style matrices, Product-Mix Auctions and Tropical Geometry, Sparse trace tests, Computing the Newton polygon of the implicit equation, Dimension results for extremal-generic polynomial systems over complete toric varieties, Sparse resultant under vanishing coefficients, On the differential structure of the ring of quasi-modular forms for \(\text{SL}_2(\mathbb Z)\), The discriminant of a system of equations, Computing tropical resultants, Quelques Aspects Diophantiens des VariéTés Toriques Projectives, Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers, Sparse difference resultant, Elimination theory in differential and difference algebra, Systems of equations with a single solution, Computing multihomogeneous resultants using straight-line programs, Efficient edge-skeleton computation for polytopes defined by oracles, Castelnuovo Mumford regularity with respect to multigraded ideals, Characteristic classes of affine varieties and Plücker formulas for affine morphisms, Sparse versions of the Cayley-Bacharach theorem, Signs of the leading coefficients of the resultant, Elimination for generic sparse polynomial systems, On the hardness of computing intersection, union and Minkowski sum of polytopes, Smooth centrally symmetric polytopes in dimension 3 are IDP, Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods, Parameter estimation in linear models with heteroscedastic variances subject to order restrictions, Hybrid sparse resultant matrices for bivariate polynomials, Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants, Newton polyhedra of discriminants of projections, Diophantine geometry and toric varieties., A parametric representation of totally mixed Nash equilibria, Tropical discriminants, Macaulay style formulas for sparse resultants, Asymptotically maximal families of hypersurfaces in toric varieties, New bounds and an efficient algorithm for sparse difference resultants, Matrix Formulae of Differential Resultant for First Order Generic Ordinary Differential Polynomials, Tropical resultants for curves and stable intersection, How to Repair Tropicalizations of Plane Curves Using Modifications, Rational formulas for traces in zero-dimensional algebras, Rational univariate reduction via toric resultants, A Polyhedral Method for Solving Sparse Polynomial Systems, Lattice polytopes cut out by root systems and the Koszul property, Galois theory for general systems of polynomial equations, Matrices in elimination theory, Solving degenerate sparse polynomial systems faster, On the Height of the Sylvester Resultant, Unnamed Item, Sparse polynomial equations and other enumerative problems whose Galois groups are wreath products, On certain families of Drinfeld quasi-modular forms, Elimination theory and Newton polytopes, How to count efficiently all affine roots of a polynomial system, Curve valuations and mixed volumes in the implicitization of rational varieties, Toric intersection theory for affine root counting, Kinematic singularities of Feynman integrals and principal \(A\)-determinants, A Poisson formula for the sparse resultant, Volumes and Ehrhart polynomials of flow polytopes, Criteria for strict monotonicity of the mixed volume of convex polytopes, Viro method for the construction of real complete intersections, Symbolic and numeric methods for exploiting structure in constructing resultant matrices, Sparse differential resultant for Laurent differential polynomials, AN ORACLE-BASED, OUTPUT-SENSITIVE ALGORITHM FOR PROJECTIONS OF RESULTANT POLYTOPES
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized Euler integrals and \(A\)-hypergeometric functions
- Chow polytopes and general resultants
- Fiber polytopes
- Mixed volumes of polytopes
- The number of roots of a system of equations
- Product formulas for resultants and Chow forms
- Newton polytopes of the classical resultant and discriminant
- Partition of Space