Related papers: Engineered complete intersections: slightly degene…

Solving systems of polynomial equations is a central problem in nonlinear and computational algebra. Since Buchberger's algorithm for computing Gr\"obner bases in the 60s, there has been a lot of progress in this domain. Moreover, these…

A generic polynomial f(x,y,z) with a prescribed Newton polytope defines a symmetric spatial curve f(x,y,z)=f(y,x,z)=0. We study its geometry: the number, degree and genus of its irreducible components, the number and type of singularities,…

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

The Bernshtein-Kushnirenko-Khovanskii theorem provides a generic root count for system of Laurent polynomials in terms of the mixed volume of their Newton polytopes (i.e., the BKK bound). A recent and far-reaching generalization of this…

Sparse (or toric) elimination exploits the structure of polynomials by measuring their complexity in terms of Newton polytopes instead of total degree. The sparse, or Newton, resultant generalizes the classical homogeneous resultant and its…

Generalizing the famous Bernstein-Kushnirenko Theorem, Khovanskii proved in 1978 a combinatorial formula for the arithmetic genus of the compactification of a generic complete intersection associated to a family of lattice polytopes.…

We study polynomials with complex coefficients which are nondegenerate in two senses, one of Kouchnirenko and the other with respect to its Newton polyhedron, through data on contact loci and motivic nearby cycles. Introducing an explicit…

The well-known Bernstein-Kushnirenko theorem from the theory of Newton polyhedra relates algebraic geometry and the theory of mixed volumes. Recently the authors have found a far-reaching generalization of this theorem to generic systems of…

Consider a polynomial $f$ with a convenient Newton polytope $P$ and generic complex coefficients. By the global version of the Kouchnirenko formula, the hypersurface $\{f = 0\} \subset \mathbb{C}^n$ has the homotopy type of a bouquet of…

The theory of Newton--Okounkov bodies provides direct relations and points out analogies between the theory of mixed volumes of convex bodies, on the one hand, and the intersection theories of Cartier divisors and of Shokurov $b$-divisors,…

We illustrate an efficient new method for handling polynomial systems with degenerate solution sets. In particular, a corollary of our techniques is a new algorithm to find an isolated point in every excess component of the zero set (over…

A subgroup H of a reductive group G is horospherical if it contains a maximal unipotent subgroup. We describe the Grothendieck semigroup of invariant subspaces of regular functions on G/H as a semigroup of convex polytopes. From this we…

The Gelfond-Khovanskii residue formula computes the sum of the values of any Laurent polynomial over solutions of a system of Laurent polynomial equations whose Newton polytopes have sufficiently general relative position. We discuss two…

In this book we describe an approach through toric geometry to the following problem: "estimate the number (counted with appropriate multiplicity) of isolated solutions of n polynomial equations in n variables over an algebraically closed…

We explicitly characterize when the Milnor number at the origin of a polynomial or power series (over an algebraically closed field k of arbitrary characteristic) is the minimum of all polynomials with the same Newton diagram, which…

In the spectral Petrov-Galerkin methods, the trial and test functions are required to satisfy particular boundary conditions. By a suitable linear combination of orthogonal polynomials, a basis, that is called the modal basis, is obtained.…

A theorem of Kushnirenko and Bernstein shows that the number of isolated roots of a system of polynomials in a torus is bounded above by the mixed volume of the Newton polytopes of the given polynomials, and this upper bound is generically…

We consider ideals of polynomials vanishing on the W-orbits of the intersections of mirrors of a finite reflection group W. We determine all such ideals which are invariant under the action of the corresponding rational Cherednik algebra…

This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…

Higher order Bernstein- and Markov-type inequalities are established for trigonometric polynomials on compact subsets of the real line and algebraic polynomials on compact subsets of the unit circle. In the case of Markov-type inequalities…