Related papers: Majorization Inequalities from Logarithmic Convexi…
In this paper, we establish some new integral inequalities for for m- and (alpha,m)-logarithmically convex functions.
We derive an explicit sum formula for symmetric Macdonald polynomials. Our expression contains multiple sums over the symmetric group and uses the action of Hecke generators on the ring of polynomials. In the special cases $t=1$ and $q=0$,…
In this paper, we prove Newton-Maclaurin type inequalities for functions obtained by linear combination of two neighboring primary symmetry functions, which is a generalization of the classical Newton-Maclaurin inequality.
In this paper, we study some properties such as the monotonicity, logarithmically complete monotonicity, logarithmic convexity, and geometric convexity, of the combinations of gamma function and power function. The results we obtain…
We extend the exponential formula by Bender and Canfield (1996), which relates log-concavity and the cycle index polynomials. The extension clarifies the log-convexity relation. The proof is by noticing the property of a compound Poisson…
We investigate quantitative implications of the notion of log-concavity through a probabilistic interpretation. In particular, we derive concentration inequalities, moment and entropy bounds for random variables satisfying a precise degree…
In an Euclidean Jordan algebra V of rank n, an element x is said to be majorized by an element y, if the corresponding eigenvalue vector of x is majorized by the eigenvalue vector of y in R^n. In this article, we describe pointwise…
The ring of symmetric functions $\Lambda$, with natural basis given by the Schur functions, arise in many different areas of mathematics. For example, as the cohomology ring of the grassmanian, and as the representation ring of the…
Inhomogeneous analogues of symmetric and nonsymmetric Macdonald polynomials were introduced by F. Knop and the author. In the symmetric case A. Okounkov has recently proved a beautiful expansion formula which can be viewed as a…
The code equivalence problem is central in coding theory and cryptography. While classical invariants are effective for Hamming and rank metrics, the sum-rank metric, which unifies both, introduces new challenges. This paper introduces new…
Some new Hermite-Hadamard's inequalities for h-convex functions are proved, generalizing and unifying a number of known results. Some new applications for special Means of real numbers are also derived.
The minimization of a nonconvex composite function can model a variety of imaging tasks. A popular class of algorithms for solving such problems are majorization-minimization techniques which iteratively approximate the composite nonconvex…
At the heart of convex geometry lies the observation that the volume of convex bodies behaves as a polynomial. Many geometric inequalities may be expressed in terms of the coefficients of this polynomial, called mixed volumes. Among the…
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 literature the Hermite-Hadamard inequality was eligible for many reasons, one of the most surprising and interesting that the Hermite-Hadamard inequality combine the midpoint and trapezoid formulae in an inequality. In this work, a…
We study combinatorial inequalities for various classes of set systems: matroids, polymatroids, poset antimatroids, and interval greedoids. We prove log-concavity inequalities for counting certain weighted feasible words, which generalize…
Starting out from a question posed by T. Erd\'elyi and J. Szabados, we consider Schur-type inequalities for the classes of complex algebraic polynomials having no zeroes within the unit disk D. The class of polynomials with no zeroes in D -…
Polynomial sequence ${P_m}_{m\geq0}$ is $q$-logarithmically concave if $P_{m}^2-P_{m+1}P_{m-1}$ is a polynomial with nonnegative coefficients for any $m\geq{1}$. We introduce an analogue of this notion for formal power series whose…
Recently, several proofs of the Mason--Welsh conjecture for matroids have been found, which asserts the log-concavity of the sequence that counts independent sets of a given size. In this article we use the theory of Lorentzian polynomials,…
The Brunn-Minkowski and Pr\'{e}kopa-Leindler inequalities admit a variety of proofs that are inspired by convexity. Nevertheless, the former holds for compact sets and the latter for integrable functions so it seems that convexity has no…