Related papers: Log-convex and Stieltjes moment sequences
This paper is devoted to the study of the log-convexity of combinatorial sequences. We show that the log-convexity is preserved under componentwise sum, under binomial convolution, and by the linear transformations given by the matrices of…
Many combinatorial numbers can be placed in the following generalized triangular array $[T_{n,k}]_{n,k\ge 0}$ satisfying the recurrence relation: \begin{equation*}…
A sequence $\{z_n\}_{n\geq0}$ is called ratio log-convex in the sense that the ratio sequence $\{\frac{z_{n+1}}{z_n}\}_{n\geq0}$ is log-convex. Based on a three-term recurrence for sequences, we develop techniques for dealing with the ratio…
We introduce the notion of infinitely log-monotonic sequences. By establishing a connection between completely monotonic functions and infinitely log-monotonic sequences, we show that the sequences of the Bernoulli numbers, the Catalan…
The sequence of Ap\'ery numbers is the moment sequence in the sense of Stieltjes. This is the short version of the proof. Appendix added for v.2
We show that the sequence of moments of order less than 1 of averages of i.i.d. positive random variables is log-concave. For moments of order at least 1, we conjecture that the sequence is log-convex and show that this holds eventually for…
A small set of combinatorial sequences have coefficients that can be represented as moments of a nonnegative measure on $[0, \infty)$. Such sequences are known as Stieltjes moment sequences. This article focuses on some classical sequences…
A sequence $(a_n)_{n \geq 0}$ is Stieltjes moment sequence if it has the form $a_n = \int_0^\infty x^n d\mu(x)$ for $\mu$ is a nonnegative measure on $[0,\infty)$. It is known that $(a_n)_{n \geq 0}$ is a Stieltjes moment sequence if and…
We prove a lemma, which we call the Order Ideal Lemma, that can be used to demonstrate a wide array of log-concavity and log-convexity results in a combinatorial manner using order ideals in distributive lattices. We use the Order Ideal…
We consider a normalized indeterminate Hamburger moment sequence s which is supposed to be Stieltjes. We revisit old results about determinacy/indeterminacy in the sense of Stieltjes for s and we prove some new results about the concepts…
McNamara and Sagan conjectured that if $a_0,a_1, a_2, \ldots$ is a P\'olya frequency (PF) sequence, then so is $a_0^2, a_1^2 -a_0a_2, a_2^2-a_1a_3, \ldots$. We prove this conjecture for a natural class of PF-sequences which are interpolated…
We consider analytic continuations of Fourier transforms and Stieltjes transforms. This enables us to define what we call complex moments for some class of probability measures which do not have moments in the usual sense. There are two…
In this paper, we present some criteria for the $2$-$q$-log-convexity and $3$-$q$-log-convexity of combinatorial sequences, which can be regarded as the first column of certain infinite triangular array $[A_{n,k}(q)]_{n,k\geq0}$ of…
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…
The Catalan number sequence is one of the most famous number sequences in combinatorics and is well studied in the literature. In this paper we further investigate its fundamental properties related to the moment problem and prove for 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…
We provide sufficient conditions under which the Catalan-like numbers are Stieltjes moment sequences. As applications, we show that many well-known counting coefficients, including the Bell numbers, the Catalan numbers, the central binomial…
We present an approach to proving the 2-log-convexity of sequences satisfying three-term recurrence relations. We show that the Apery numbers, the Cohen-Rhin numbers, the Motzkin numbers, the Fine numbers, the Franel numbers of order 3 and…
We survey some of the mechanisms used to prove that naturally defined sequences in combinatorics are log-concave. Among these mechanisms are Alexandrov's inequality for mixed discriminants, the Alexandrov Fenchel inequality for mixed…
A class of Stieltjes functions of finite type is introduced. These satisfy Widder's conditions on the successive derivatives up to some finite order, and are not necessarily smooth. We show that such functions have a unique integral…