Related papers: The Reverse Ultra Log-Concavity of the Boros-Moll …
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…
We identify a structural pattern in the construction of known infinite families of trees whose independence polynomials are not log-concave. Using this pattern and properties of polynomial ring ideals, we derive linear recurrences for these…
Let the Bessel number of the second kind B(n,k) be the number of set partitions of [n] into k blocks of size one or two, and let the Bessel number of the first kind b(n,k) be a certain coefficient in n-th Bessel polynomial. In this paper,…
Let ${\cal P}_n^c$ denote the set of all algebraic polynomials of degree at most $n$ with complex coefficients. Let $$D^+ := \{z \in \mathbb{C}: |z| \leq 1, \, \, \Im(z) \geq 0\}$$ be the closed upper half-disk of the complex plane. For…
In this paper we develop the theory of quantum reverse hypercontractivity inequalities and show how they can be derived from log-Sobolev inequalities. Next we prove a generalization of the Stroock-Varopoulos inequality in the…
We introduce the notion of logarithmically concave (or log-concave) sequences in Coding Theory. A sequence $a_0, a_1, \dots, a_n$ of real numbers is called log-concave if $a_i^2 \ge a_{i-1}a_{i+1}$ for all $1 \le i \le n-1$. A natural…
We investigate geometric and functional inequalities for the class of log-concave probability sequences. We prove dilation inequalities for log-concave probability measures on the integers. A functional analogue of this geometric inequality…
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).
R. Pemantle conjectured, and T.M. Liggett proved in 1997, that the convolution of two ultra-logconcave is ultra-logconcave. Liggett's proof is elementary but long. We present here a short proof, based on the mixed volume of convex sets.
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…
We show that normalized Schur polynomials are strongly log-concave. As a consequence, we obtain Okounkov's log-concavity conjecture for Littlewood-Richardson coefficients in the special case of Kostka numbers.
We establish a conjecture of Graham and Lov\'asz that the (normalized) coefficients of the distance characteristic polynomial of a tree are unimodal; we also prove they are log-concave.
Inequalities are important features in the context of sequences of numbers and polynomials. The Bessenrodt--Ono inequality for partition numbers and Nekrasov--Okounkov polynomials has only recently been discovered. In this paper we study…
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 this paper, we use the analytic method of Odlyzko and Richmond to study the log-concavity of power series. If $f(z) = \sum_n a_nz^n$ is an infinite series with $a_n \geq 1$ and $a_0 + \cdots + a_n = O(n + 1)$ for all $n$, we prove that a…
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,…
In a recent paper, the first author proved the log-concavity of the coefficients of the characteristic polynomial of a matroid realizable over a field of characteristic 0, answering a long-standing conjecture of Read in graph theory. We…
We consider a class of strongly q-log-convex polynomials based on a triangular recurrence relation with linear coefficients, and we show that the Bell polynomials, the Bessel polynomials, the Ramanujan polynomials and the Dowling…
We give counterexamples to Okounkov's log-concavity conjecture for Littlewood-Richardson coefficients.
Let p and r be two primes and n, m be two distinct divisors of pr. Consider the n-th and m-th cyclotomic polynomials. In this paper, we present lower and upper bounds for the coefficients of the inverse of one of them modulo the other one.…