Related papers: Log-concavity for partitions without sequences
Motivated by the convolutive behavior of the counting function for partitions with designated summands in which all parts are odd, we consider coefficient sequences $(a_n)_{n\ge 0}$ of primitive eta-products that satisfy the generic…
We establish necessary and sufficient conditions for convergence (in the sense of finite dimensional distributions) of multiplicative measures on the set of partitions. We show that this convergence is equivalent to asymptotic independence…
On observing a sequence of i.i.d.\ data with distribution $P$ on $\mathbb{R}^d$, we ask the question of how one can test the null hypothesis that $P$ has a log-concave density. This paper proves one interesting negative and positive result:…
We construct a class of perturbations of the Cauchy-Riemann equations for maps from curves to a Calabi-Yau threefold. Our perturbations vanish on components of zero symplectic area. For generic 1-parameter families of perturbations, the…
We find sufficient conditions for log-convexity and log-concavity for the functions of the forms $a\mapsto\sum{f_k}(a)_kx^k$, $a\mapsto\sum{f_k}\Gamma(a+k)x^k$ and $a\mapsto\sum{f_k}x^k/(a)_k$. The most useful examples of such functions are…
In a previous paper: A. Paszkiewicz, T. Sobieszek, Additive Entropies of Partitions, we have given a description of additive partition entropies that is real functions $I$ on the set of finite partitions that are additive on stochastically…
A partition statistic ` crank' gives combinatorial interpretations for Ramanujan's famous partition congruences. In this paper, we establish an asymptotic formula, Ramanujan type congruences, and q-series identities that the number of…
Let $f(q)$ denote Ramanujan's mock theta function \[f(q) = \sum_{n=0}^{\infty} a(n) q^{n} := 1+\sum_{n=1}^{\infty} \frac{q^{n^{2}}}{(1+q)^{2}(1+q^{2})^{2}\cdots(1+q^{n})^{2}}.\] It is known that there are many linear congruences for the…
Bessenrodt and Ono initially found the strict log-subadditivity of partition function $p(n)$, that is, $p(a+b)< p(a)p(b)$ for $a,b>1$ and $a+b>9$. Many other important statistics of partitions are proved to enjoy similar properties. Lovejoy…
Recently, Rattan and the first author (Ann. Comb. 25 (2021) 697-728) proved a conjectured inequality of Berkovich and Uncu (Ann. Comb. 23 (2019) 263-284) concerning partitions with an impermissible part. In this article, we generalize this…
We prove analytic and combinatorial identities reminiscent of Schur's classical partition theorem. Specifically, we show that certain families of overpartitions whose parts satisfy gap conditions are equinumerous with partitions whose parts…
We show that the likelihood function for a multinomial vector observed under arbitrary interval censoring constraints on the frequencies or their partial sums is completely log-concave by proving that the constrained sample spaces comprise…
Denote by $N_{\ell}(n)$ the number of $\ell$-tuples of elements in the symmetric group $S_n$ with commuting components, normalized by the order of $S_n$. In this paper, we prove asymptotic formulas for $N_\ell(n)$. In addition, general…
The values of the partition function, and more generally the Fourier coefficients of many modular forms, are known to satisfy certain congruences. Results given by Ahlgren and Ono for the partition function and by Treneer for more general…
In this paper we introduce a class of sequences connected with the $m$--ary partition function and investigate their congruence properties. In particular, we get facts about the sequences of $m$--ary partitions $(b_{m}(n))_{m\in\mathbb{N}}$…
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…
We prove multiplicative congruences mod $2^{12}$ for George Andrews's partition function, $\overline{\mathcal{EO}}(n)$, the number of partitions of $n$ in which every even part is less than each odd part and only the largest even part…
Previous work showed that, for $\nu_2(n)$ the number of partitions of $n$ into exactly two part sizes, one has $\nu_2(16n + 14) \equiv 0 \pmod{4}$. The earlier proof required the technology of modular forms, and a combinatorial proof was…
We develop a new technique for proving distribution testing lower bounds for properties defined by inequalities involving the bin probabilities of the distribution in question. Using this technique we obtain new lower bounds for…
An upper bound on the ergodic capacity of {\bf MIMO} channels was introduced recently in arXiv:0903.1952. This upper bound amounts to the maximization on the simplex of some multilinear polynomial $p(\lambda_1,...,\lambda_n)$ with…