Related papers: On extending the class of convex functions

The study of convex functions - in particular, of their optimization (really minimization) is one of the most important fields of applied mathematics. Convexity seems to be one of those incredibly well-chosen hypotheses which is just…

We analyze matrix convex functions of a fixed order defined on a real interval by differential methods as opposed to the characterization in terms of divided differences given by Kraus. We obtain for each order conditions for matrix…

The question how to certify non-negativity of a polynomial function lies at the heart of Real Algebra and also has important applications to Optimization. In this article we investigate the question of non-negativity in the context of…

It is well known that the dominant eigenvalue of a real essentially nonnegative matrix is a convex function of its diagonal entries. This convexity is of practical importance in population biology, graph theory, demography, analytic…

We prove the complete monotonicity on $(0,\infty)^n$ for suitable inverse powers of the spanning-tree polynomials of graphs and, more generally, of the basis generating polynomials of certain classes of matroids. This generalizes a result…

Using a known recursive formula for the Grothendieck classes of the moduli spaces $\overline{\mathcal M}_{0,n}$, we prove that they satisfy an asymptotic form of ultra-log-concavity as polynomials in the Lefschetz class. We also observe…

Real-stable, Lorentzian, and log-concave polynomials are well-studied classes of polynomials, and have been powerful tools in resolving several conjectures. We show that the problems of deciding whether a polynomial of fixed degree is real…

Extension problems for polynomial valuations on different cones of convex functions are investigated. It is shown that for the classes of functions under consideration, the extension problem reduces to a simple geometric obstruction on the…

In this paper, we provide criteria for the log-concavity of rows and the strong $q$-log-convexity of the generating functions of rows in more generalized triangles. Additionally, we prove that the bi$^s$nomial transformation not only…

In this paper we investigate continuity properties of functions $f:\mathbb{R}_+\to\mathbb{R}_+$ that satisfy the $(p,q)$-Jensen convexity inequality $$ f\big(H_p(x,y)\big)\leq H_q(f(x),f(y)) \qquad(x,y>0), $$ where $H_p$ stands for the…

The familiar second derivative test for convexity, combined with resolvent calculus, is shown to yield a useful tool for the study of convex matrix-valued functions. We demonstrate the applicability of this approach on a number of theorems…

We generalize Araki's log-majorization to the log-convexity theorem for the eigenvalues of $\Phi(A^p)^{1/2}\Psi(B^p)\Phi(A^p)^{1/2}$ as a function of $p\ge0$, where $A,B$ are positive semidefinite matrices and $\Phi,\Psi$ are positive…

We prove a conjecture of Liu and Wang on the q-log-convexity of the polynomial sequence $\{\sum_{k=0}^n{n\choose k}^2q^k\}_{n\geq 0}$. By using Pieri's rule and the Jacobi-Trudi identity for Schur functions, we obtain an expansion of a sum…

The paper studies logarithmic convexity and concavity of power series with coefficients involving q-gamma functions or q-shifted factorials with respect to a parameter contained in their arguments. The principal motivating examples of such…

A classical result of Malgrange says that for a polynomial P and an open subset $\Omega$ of $\R^d$ the differential operator $P(D)$ is surjective on $C^\infty(\Omega)$ if and only if $\Omega$ is P-convex. H\"ormander showed that $P(D)$ is…

By using optimal mass transport theory, we provide a direct proof to the sharp $L^p$-log-Sobolev inequality $(p\geq 1)$ involving a log-concave homogeneous weight on an open convex cone $E\subseteq \mathbb R^n$. The perk of this proof is…

The main result of the paper is the following: Every $z$-linear maps is a functional p-convex. We will prove this statement using lemma developed by Kalton and Peck [6] and theorem developed by Aoki and Rolewicz.Based on the definition of…

It has recently been shown that the problem of testing global convexity of polynomials of degree four is {strongly} NP-hard, answering an open question of N.Z. Shor. This result is minimal in the degree of the polynomial when global…

We show that the large Cartesian powers of any graph have log-concave valencies with respect to a ffxed vertex. We show that the series of valencies of distance regular graphs is log-concave, thus improving on a result of (Taylor,…

We give a short proof of the log-concavity of the coefficients of the reduced characteristic polynomial of a matroid. The proof uses an extension of the theory of Lorentzian polynomials to convex cones, and reproves the Hodge-Riemann…