相关论文: Bell numbers, log-concavity, and log-convexity

A set of reals A={a_1,...,a_2} is called convex if a_{i+1} - a_i > a_i - a_{i-1} for all i. We prove, in particular, that |A-A| \gg |A|^{8/5} \log{-2/5} |A|.

In this paper, among other results, we improve the best known estimates for the constants of the generalized Bohnenblust-Hille inequality. These enhancements are then used to improve the best known constants of the Hardy--Littlewood…

Let $d_i(m)$ denote the coefficients of the Boros-Moll polynomials. Moll's minimum conjecture states that the sequence $\{i(i+1)(d_i^2(m)-d_{i-1}(m)d_{i+1}(m))\}_{1\leq i \leq m}$ attains its minimum with $i=m$. This conjecture is a…

We prove a sharp moment inequality for a log-concave or a log-convex function, on Gaussian random vectors. As an application we take a stability result for the classical logarithmic Sobolev inequality of L. Gross in the case where the…

In this paper, we study power series with coefficients equal to a product of a generic sequence and an explicitly given function of a positive parameter expressible in terms of the Pochhammer symbols. Four types of such series are treated.…

A sequence $\{x_{n}\}_1^\infty$ in $[0,1)$ is called Borel-Cantelli (BC) if for all non-increasing sequences of positive real numbers $\{a_n\}$ with $\underset{i=1}{\overset{\infty}{\sum}}a_i=\infty$ the set…

The algebraic derivation of the numerical limits of Bell inequalities in either three or four random variables is independent of the assumption of randomness.The limits of the inequalities follow as mathematical consequences of their…

Recently, Z. W. Sun put forward a series of conjectures on monotonicity of combinatorial sequences in the form of $\{z_n/z_{n-1}\}_{n=N}^\infty$ and $\{\sqrt[n+1]{z_{n+1}}/\sqrt[n]{z_n}\}_{n=N}^\infty$ for some positive integer $N$, where…

We discuss a class of proofs of Bell-type inequalities that are based on tables of potential outcomes. These proofs state in essence: if one can only imagine (or write down in a table) the potential outcome of a hidden parameter model for…

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…

Let $\overline{p}(n)$ denote the overpartition function. In this paper, we obtain an inequality for the sequence $\Delta^{2}\log \ \sqrt[n-1]{\overline{p}(n-1)/(n-1)^{\alpha}}$ which states that \begin{equation*} \log…

Bi-log-concavity of probability measures is a univariate extension of the notion of log-concavity that has been recently proposed in a statistical literature. Among other things, it has the nice property from a modelisation perspective to…

In this article, we provide a comprehensive analysis of the asymptotic behavior of Bell numbers, enhancing and unifying various results previously dispersed in the literature. We establish several explicit lower and upper bounds. The main…

We prove that in a large collection of naturally defined sets of permutations of fixed length, the numbers of permutations at Ulam distance k from the identity form a log-concave sequence in k.

We introduce Bell inequalities based on covariance, one of the most common measures of correlation. Explicit examples are discussed, and violations in quantum theory are demonstrated. A crucial feature of these covariance Bell inequalities…

There are several versions of Bell's inequalities, proved in different contexts, using different sets of assumptions. The discussions of their experimental violation often disregard some required assumptions and use loose formulations of…

Log-Brunn-Minkowski inequality was conjectured by Bor\"oczky, Lutwak, Yang and Zhang \cite{BLYZ}, and it states that a certain strengthening of the classical Brunn-Minkowski inequality is admissible in the case of symmetric convex sets. It…

Let $A_1, \ldots ,A_m$ and $B_1, \ldots ,B_m$ be subsets of $[n]$ and let $t$ be a non-negative integer with the following property: $|A_i \cap B_i|\leq t$ for each $i$ and $|A_i\cap B_j|>t$ whenever $i< j$. Then $m\leq 2^{n-t}$. Our proof…

Let b > 1 be an integer and denote by s_b(m) the sum of the digits of the positive integer m when is written in base b. We prove that s_b(n!) > C_b log n log log log n for each integer n > e, where C_b is a positive constant depending only…

In this article we consider questions related to the behavior of the moments $M_{m}\left( \left\{ z_{j}\right\} \right) $ when the indices are restricted to specific subsequences of integers, such as the even or odd moments. If $n\geq2$ we…