Related papers: Real Stability and Log Concavity are coNP-Hard

Using calculus we show how to prove some combinatorial inequalities of the type log-concavity or log-convexity. It is shown by this method that binomial coefficients and Stirling numbers of the first and second kinds are log-concave, and…

Univariate polynomials are called stable with respect to a domain $D$ if all of their roots lie in $D$. We study linear slices of the space of stable univariate polynomials with respect to a half-plane. We show that a linear slice always…

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

Criteria are given for determining whether an irreducible sextic equation with rational coefficients is algebraically solvable over the complex numbers.

We use the theory of resultants of polynomials to study the stability of an arbitrary polynomial over a finite field, that is, the property of having all its iterates irreducible. This result partially generalises the quadratic polynomial…

The purpose of this work is to present the derivation and an estimate of the degrees of the best approximation based on convex, coconvex and unconstrained polynomials, and discuss some applications. We simplify the term convex and coconvex…

Many interesting questions in arithmetic dynamics revolve, in one way or another, around the (local and/or global) reducibility behavior of iterates of a polynomial. We show that for very general families of integer polynomials $f$ (and,…

This paper proposes an efficient algorithm for testing copositivity of homogeneous polynomials over the positive semidefinite cone. The algorithm is based on a novel matrix optimization reformulation and requires solving a hierarchy of…

We present algorithms revealing new families of polynomials allowing sub-exponential detection of p-adic rational roots, relative to the sparse encoding. For instance, we show that the case of honest n-variate (n+1)-nomials is doable in NP…

Let $X$ be a smooth projective curve of genus $g\geq 2$ over the complex numbers. A holomorphic triple $(E_1,E_2,\phi)$ on $X$ consists of two holomorphic vector bundles $E_1$ and $E_2$ over $X$ and a holomorphic map $\phi:E_2 \to E_1$.…

We consider the transition from a spatially uniform state to a steady, spatially-periodic pattern in a partial differential equation describing long-wavelength convection. This both extends existing work on the study of rolls, squares and…

We study the orthogonal projection of homogeneous polynomials onto the space of homogeneous polyharmonic polynomials. To do this we derive the decomposition of homogeneous polynomials in terms of the Kelvin transform of derivatives of the…

This paper introduces a generic framework that provides sufficient conditions for guaranteeing polynomial-time decidability of fixed-negation fragments of first-order theories that adhere to certain fixed-parameter tractability…

The paper proves Liouville-type results for stable solutions of semilinear elliptic PDEs with convex nonlinearity, posed on the entire Euclidean space. Extensions to solutions which are stable outside a compact set are also presented.

It is shown that a positive linear system on a time scale with a bounded graininess is uniformly exponentially stable if and only if the characteristic polynomial of the matrix defining the system has all its coefficients positive. Then…

Orthogonal polynomials of two real variables can often be represented in complex variables. We explore the connection between the two types of representations and study the structural relations of complex orthogonal polynomials. The complex…

A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…

A fast consistency prover is a consistent poly-time axiomatized theory that has short proofs of the finite consistency statements of any other poly-time axiomatized theory. Kraj\'\i\v{c}ek and Pudl\'ak proved that the existence of an…

Clustering with most objective functions is NP-Hard, even to approximate well in the worst case. Recently, there has been work on exploring different notions of stability which lend structure to the problem. The notion of stability,…

We show that detecting real roots for honestly n-variate (n+2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any fixed n. The best previous complexity bounds were exponential in…