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

A conservative class of constraint satisfaction problems CSPs is a class for which membership is preserved under arbitrary domain reductions. Many well-known tractable classes of CSPs are conservative. It is well known that lexleader…

One question that we investigate in this paper is, how can we build log-concave polynomials using sparse polynomials as building blocks? More precisely, let $f = \sum\_{i = 0}^d a\_i X^i \in \mathbb{R}^+[X]$ be a polynomial satisfying the…

We survey the problem of deciding the stability or stabilizability of uncertain linear systems whose region of uncertainty is a polytope. This natural setting has applications in many fields of applied science, from Control Theory to…

Automated program verification often proceeds by exhibiting inductive invariants entailing the desired properties.For numerical properties, a classical class of invariants is convex polyhedra: solution sets of system of linear…

We give an elementary proof of a somewhat curious result, namely, that deciding whether a convex function is self-concordant is in general an intractable problem.

A polynomial $f(x)$ over a field $K$ is called stable if all of its iterates are irreducible over $K$. In this paper we study the stability of trinomials over finite fields. Specially, we show that if $f(x)$ is a trinomial of even degree…

We show that for continuous time dynamical systems described by polynomial differential equations of modest degree (typically equal to three), the following decision problems which arise in numerous areas of systems and control theory…

We investigate the computational complexity of deciding whether a given univariate integer polynomial p(x) has a factor q(x) satisfying specific additional constraints. When the only constraint imposed on q(x) is to have a degree smaller…

We study stable matching problems where agents have multilayer preferences: There are $\ell$ layers each consisting of one preference relation for each agent. Recently, Chen et al. [EC '18] studied such problems with strict preferences,…

We establish various certifying determinantal representation results for a polynomial that contains as a factor a prescribed multivariable polynomials that is strictly stable on a tube domain. The proofs use a Cayley transform in…

In this brief note, it is shown that the function p^TW log(p) is convex in p if W is a diagonally dominant positive definite M-matrix. The techniques used to prove convexity are well-known in linear algebra and essentially involves…

We study a question with connections to linear algebra, real algebraic geometry, combinatorics, and complex analysis. Let $p(x,y)$ be a polynomial of degree $d$ with $N$ positive coefficients and no negative coefficients, such that $p=1$…

Let $m$ and $k \geq 2$ be positive integers. We show that polynomial $P = (1+x)^m(1+x^k)$ is strongly unimodal (frequently known as {\it log concave\/}) if and only if $m \geq k^2 -3$; this is also the criterion for $P$ to be merely…

We show that computing the strongest polynomial invariant for single-path loops with polynomial assignments is at least as hard as the Skolem problem, a famous problem whose decidability has been open for almost a century. While the…

New approaches to the study of stability of solutions of Set Differential Equations (SDEs) based on convex geometry and the theory of mixed volumes were proposed. The stability of the forms of program solutions of linear SDEs with a stable…

Let $q$ be a prime power. We construct stable polynomials of the form $b^{m-1}(x+a)^m+c(x+a)+d$ over a finite field $\mathbb{F}_{q}$ for $m=2,3,4$ by Capelli's lemma. When $m=3$ and $q$ is even, we confirm the conjecture of Ahmadi and…

Stable gonality is a multigraph parameter that measures the complexity of a graph. It is defined using maps to trees. Those maps, in some sense, divide the edges equally over the edges of the tree; stable gonality asks for the map with the…

Inspired by the theory of hyperbolic polynomials and Hodge theory, we develop the theory of Lorentzian polynomials on cones. This notion captures the Hodge-Riemann relations of degree zero and one. Motivated by fundamental properties of…

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

A finitely generated quadratic module or preordering in the real polynomial ring is called stable, if it admits a certain degree bound on the sums of squares in the representation of polynomials. Stability, first defined explicitly by…