Related papers: Inequalities for Plane Partitions
Here we study the roots of the doubly infinite family of Jensen polynomials $J_{\mathrm{PL}}^{d,n}(x)$ associated to MacMahon's plane partition function $\mathrm{PL}(n)$. Recently, Ono, Pujahari, and Rolen proved that $\mathrm{PL}(n)$ is…
We investigate the parity of the coefficients of certain eta-quotients, extensively examining the case of $m$-regular partitions. Our theorems concern the density of their odd values, in particular establishing lacunarity modulo 2 for…
Nicolas and DeSalvo and Pak proved that the partition function $p(n)$ is log concave for $n \geq 25$. Chen, Jia and Wang proved that $p(n)$ satisfies the third order Tur\'{a}n inequality, and that the associated degree 3 Jensen polynomials…
We establish the log-concavity of the volume of central sections of dilations of the cross-polytope (the strong B-inequality for the cross-polytope and Lebesgue measure restricted to an arbitrary subspace).
We review some simple techniques based on monotone mass transport that allow to obtain transport-type inequalities for any log-concave probability measure, and for more general measures as well. We discuss quantitative forms of these…
We prove the reverse ultra log-concavity of the Boros-Moll polynomials. We further establish an inequality which implies the log-concavity of the sequence $\{i!d_i(m)\}$ for any $m\geq 2$, where $d_i(m)$ are the coefficients of the…
In this note, we study the differentiability of the arithmetic volumes along arithmetic R-divisors, and give some equality conditions for the Brunn-Minkowski inequality for arithmetic volumes over the cone of nef and big arithmetic…
The number of partitions of $n$ wherein odd parts are distinct and even parts are unrestricted, often denoted by $pod(n)$. In this paper, we provide linear recurrence relations for $pod(n)$, and the connections of $pod(n)$ with other…
The purpose of this short note is to demonstrate uniform logarithmic Sobolev inequalities for the mean field gradient particle systems associated to an energy functional that is convex in the flat sense. A defective log-Sobolev inequality…
The main purpose of this survey is to provide an introduction, algebro-topological in nature, to Hirzebuch-type inequalities for plane curve arrangements in the complex projective plane. These inequalities gain more and more interest due to…
We propose a method to generate cutting-planes from multiple covers of knapsack constraints. The covers may come from different knapsack inequalities if the weights in the inequalities form a totally-ordered set. Thus, we introduce and…
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…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
We study the asymptotic behaviour of the trace (the sum of the diagonal parts) of a plane partition of the positive integer n, assuming that this parfition is chosen uniformly at random from the set of all such partitions.
We relate transport-entropy inequalities to the study of critical points of functionals defined on the space of probability measures. This approach leads in particular to a new proof of a result by Otto and Villani [43] showing that the…
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…
In the present paper we initiate the study of a certain kind of partition inequality, by showing, for example, that if $M\geq 5$ is an integer and the integers $a$ and $b$ are relatively prime to $M$ and satisfy $1\leq a<b<M/2$, and the…
A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…
Asymptotic formulas of the number of various partitions are studied, like 3-colored partitions, concave partitions, certain plane partitions, partitions without small parts, the number of p-rings.
The partition function $pod(n)$ enumerates the partitions of $n$ wherein odd parts are distinct and even parts are unrestricted. Recently, a number of properties for $pod(n)$ have been established. In this paper, for $k\in\{0,2\}$ we…