Related papers: Imaginary projections of polynomials

A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate…

In this short note, we reduce lower bounds on monotone projections of polynomials to lower bounds on extended formulations of polytopes. Applying our reduction to the seminal extended formulation lower bounds of Fiorini, Massar, Pokutta,…

This paper proves that the characteristic polynomial is a complete unitary invariant for pairs of projection matrices. Some special cases involving three or more projections are also considered.

One can associate to any bivariate polynomial P(X,Y) its Newton polygon. This is the convex hull of the points (i,j) such that the monomial X^i Y^j appears in P with a nonzero coefficient. We conjecture that when P is expressed as a sum of…

Given a univariate polynomial, its abscissa is the maximum real part of its roots. The abscissa arises naturally when controlling linear differential equations. As a function of the polynomial coefficients, the abscissa is H{\"o}lder…

Let $M$ be a strictly convex smooth connected hypersurface in $\mathbb R^n$ and $\widehat{M}$ its convex hull. We say that $M$ is locally polynomially integrable if the $(n-1)-$ dimensional volumes of the sections of $\widehat M$ by…

The monodromy conjecture is a mysterious open problem in singularity theory. Its original version relates arithmetic and topological/geometric properties of a multivariate polynomial $f$ over the integers, more precisely, poles of the…

We consider the class of all homogeneous, possibly non-reduced, polynomials $f$ whose associated reduced projective divisor $D_{\text{red}} \subset \mathbb{P}^{n-1}$ has (at worst) quasi-homogeneous isolated singularities. In an arbitrary…

A polynomial with rational coefficients is said to be pure with respect to a rational prime $p$ if its Newton polygon has one slope. In this article, we prove that the number of irreducible factors of the $n$-th iterate of a pure polynomial…

We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…

In this paper we extend the notion of a Lorentz cone. We call a closed convex set isotone projection set with respect to a pointed closed convex cone if the projection onto the set is isotone (i.e., monotone) with respect to the order…

We strengthen the classical approximation theorems of Weierstrass, Runge and Mergelyan by showing the polynomial and rational approximants can be taken to have a simple geometric structure. In particular, when approximating a function $f$…

We show the existence of an FPTAS for the problem of maximizing a non-negative polynomial over mixed-integer sets in convex polytopes, when the number of variables is fixed.

This paper considers projection and convolution operations for integrally convex functions, which constitute a fundamental function class in discrete convex analysis. It is shown that the class of integrally convex functions is stable under…

Let R be an integral domain and let f(X) be a nonzero polynomial in R[X]. The content of f is the ideal c(f) generated by the coefficients of f. The polynomial f(X) is called Gaussian if c(fg)=c(f)c(g) for all g(X) in R[X]. It is well known…

We study the rational approximation properties of special manifolds defined by a set of polynomials with rational coefficients. Mostly we will assume the case of all polynomials to depend on only one variable. In this case the manifold can…

The expected number of real projective roots of orthogonally invariant random homogeneous real polynomial systems is known to be equal to the square root of the B\'ezout number. A similar result is known for random multi-homogeneous…

Let $A$ be a square complex matrix, $z_1$, ..., $z_{n}\in\mathbb C$ be (possibly repetitive) points of interpolation, $f$ be analytic in a neighborhood of the convex hull of the union of the spectrum of $A$ and the points $z_1$, ...,…

The extension complexity $\mathsf{xc}(P)$ of a polytope $P$ is the minimum number of facets of a polytope that affinely projects to $P$. Let $G$ be a bipartite graph with $n$ vertices, $m$ edges, and no isolated vertices. Let…

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each cardinality and its roots are called independence roots. We investigate here purely imaginary independence roots. We show that…