Polynomial Equations and Convex Polytopes
From MaRDI portal
Publication:2757322
DOI10.2307/2589283zbMath0988.52021OpenAlexW4235601388WikidataQ29040667 ScholiaQ29040667MaRDI QIDQ2757322
Publication date: 26 November 2001
Full work available at URL: https://doi.org/10.2307/2589283
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Numerical computation of solutions to systems of equations (65H10) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)
Related Items
Zero-patterns of polynomials and Newton polytopes. ⋮ Random monomial ideals ⋮ Generating approximate parametric roots of parametric polynomials ⋮ Off-the-Grid Recovery of Piecewise Constant Images from Few Fourier Samples ⋮ From the zonotope construction to the Minkowski addition of convex polytopes ⋮ Numerical root finding via Cox rings ⋮ Keplerian integrals, elimination theory and identification of very short arcs in a large database of optical observations ⋮ A polyhedral homotopy algorithm for real zeros ⋮ Asymptotic degree of random monomial ideals ⋮ A theorem and an algorithm involving Muirhead's inequality ⋮ Coercive polynomials: stability, order of growth, and Newton polytopes ⋮ General equilibrium models and homotopy methods ⋮ Counting and locating the solutions of polynomial systems of maximum likelihood equations. I. ⋮ Effects of selection and mutation on epidemiology of X-linked genetic diseases ⋮ On globally diffeomorphic polynomial maps via Newton polytopes and circuit numbers ⋮ Real Schubert Calculus: Polynomial Systems and a Conjecture of Shapiro and Shapiro ⋮ Numerical Evidence for a Conjecture in Real Algebraic Geometry ⋮ Stability and performance verification of optimization-based controllers ⋮ A linear equation for Minkowski sums of polytopes relatively in general position ⋮ Parameter estimation in linear models with heteroscedastic variances subject to order restrictions ⋮ Bernstein's second theorem and Viro's method for sparse polynomial systems in chemistry ⋮ Solving Polynomial Systems via Truncated Normal Forms ⋮ Cylinders Through Five Points: Complex and Real Enumerative Geometry ⋮ Convex polytopes and factorization properties in generalized power series domains ⋮ Smaller SDP for SOS decomposition ⋮ A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor ⋮ Coercive Polynomials and Their Newton Polytopes ⋮ Newton polytopes in algebraic combinatorics ⋮ A \(\tau \)-conjecture for Newton polygons ⋮ A family of sparse polynomial systems arising in chemical reaction systems
