Preservation of log-concavity on summation

We obtain a strong invariance principle for nonconventional sums and applying this result we derive for them a version of the law of iterated logarithm, as well as an almost sure central limit theorem. Among motivations for such results are their applications to multiple recurrence for stochastic processes and dynamical systems.

A useful heuristic in the understanding of large random combinatorial structures is the Arratia-Tavare principle, which describes an approximation to the joint distribution of component-sizes using independent random variables. The principle outlines conditions under which the total variation distance between the true joint distribution and the approximation should be small, and was successfully exploited by Pittel in the cases of integer partitions and set partitions. We pro...

Recently, introduced are the generalized Euler-Genocchi and generalized degenerate Euler-Genocchi polynomials. The aim of this note is to study the multi-Euler-Genocchi and degenerate multi-Euler-Genocchi polynomials which are defined by means of the multiple logarithm and generalize respectively the generalized Euler-Genocchi and generalized degenerate Euler-Genocchi polynomials. Especially, we express the former by the generalized Euler-Genocchi polynomials, the multi-Stirl...

A triangle $\{a(n,k)\}_{0\le k\le n}$ of nonnegative numbers is LC-positive if for each $r$, the sequence of polynomials $\sum_{k=r}^{n}a(n,k)q^k$ is $q$-log-concave. It is double LC-positive if both triangles $\{a(n,k)\}$ and $\{a(n,n-k)\}$ are LC-positive. We show that if $\{a(n,k)\}$ is LC-positive then the log-concavity of the sequence $\{x_k\}$ implies that of the sequence $\{z_n\}$ defined by $z_n=\sum_{k=0}^{n}a(n,k)x_k$, and if $\{a(n,k)\}$ is double LC-positive then ...

We show that Stieltjes moment sequences are infinitely log-convex, which parallels a famous result that (finite) P\'olya frequency sequences are infinitely log-concave. We introduce the concept of $q$-Stieltjes moment sequences of polynomials and show that many well-known polynomials in combinatorics are such sequences. We provide a criterion for linear transformations and convolutions preserving Stieltjes moment sequences. Many well-known combinatorial sequences are shown to...

When the distribution of a random (N) sum of independent copies of a r.v X is of the same type as that of X we say that X is N-sum stable. In this paper we consider a generalization of stability of geometric sums by studying distributions that are stable under summation w.r.t Harris law. We show that the notion of stability of random sums can be extended to include the case when X is discrete. Finally we propose a method to identify the probability law of N for which X is N-s...

We consider the problem of bounding large deviations for non-i.i.d. random variables that are allowed to have arbitrary dependencies. Previous works typically assumed a specific dependence structure, namely the existence of independent components. Bounds that depend on the degree of dependence between the observations have only been studied in the theory of mixing processes, where variables are time-ordered. Here, we introduce a new way of measuring dependences within an unor...

A survey paper on some recent results on additive problems with prime powers.

A remarkable conjecture of Feige (2006) asserts that for any collection of $n$ independent non-negative random variables $X_1, X_2, \dots, X_n$, each with expectation at most $1$, $$ \mathbb{P}(X < \mathbb{E}[X] + 1) \geq \frac{1}{e}, $$ where $X = \sum_{i=1}^n X_i$. In this paper, we investigate this conjecture for the class of discrete log-concave probability distributions and we prove a strengthened version. More specifically, we show that the conjectured bound $1/e$ holds...

This is a survey of old and new problems and results in additive number theory.