ﻻ يوجد ملخص باللغة العربية
The Tur{a}n inequalities and the higher order Tur{a}n inequalities arise in the study of Maclaurin coefficients of an entire function in the Laguerre-P{o}lya class. A real sequence ${a_{n}}$ is said to satisfy the Tur{a}n inequalities if for $ngeq 1$, $a_n^2-a_{n-1}a_{n+1}geq 0$. It is said to satisfy the higher order Tur{a}n inequalities if for $ngeq 1$, $4(a_{n}^2-a_{n-1}a_{n+1})(a_{n+1}^2-a_{n}a_{n+2})-(a_{n}a_{n+1}-a_{n-1}a_{n+2})^2geq 0$. A sequence satisfying the Turan inequalities is also called log-concave. For the partition function $p(n)$, DeSalvo and Pak showed that for $n>25$, the sequence ${ p(n)}_{n> 25}$ is log-concave, that is, $p(n)^2-p(n-1)p(n+1)>0$ for $n> 25$. It was conjectured by Chen that $p(n)$ satisfies the higher order Tur{a}n inequalities for $ngeq 95$. In this paper, we prove this conjecture by using the Hardy-Ramanujan-Rademacher formula to derive an upper bound and a lower bound for $p(n+1)p(n-1)/p(n)^2$. Consequently, for $ngeq 95$, the Jensen polynomials $g_{3,n-1}(x)=p(n-1)+3p(n)x+3p(n+1)x^2+p(n+2)x^3$ have only real zeros. We conjecture that for any positive integer $mgeq 4$ there exists an integer $N(m)$ such that for $ngeq N(m) $, the polynomials $sum_{k=0}^m {mchoose k}p(n+k)x^k$ have only real zeros. This conjecture was independently posed by Ono.
In order to provide a unified combinatorial interpretation of congruences modulo $5$ for 2-colored partition functions, Garvan introduced a bicrank statistic in terms of weighted vector partitions. In this paper, we obtain some inequalities between t
Motivated by a partition inequality of Bessenrodt and Ono, we obtain analogous inequalities for $k$-colored partition functions $p_{-k}(n)$ for all $kgeq2$. This enables us to extend the $k$-colored partition function multiplicatively to a function o
We obtain a unification of two refinements of Eulers partition theorem respectively due to Bessenrodt and Glaisher. A specialization of Bessenrodts insertion algorithm for a generalization of the Andrews-Olsson partition identity is used in our combinatorial construction.
The spt-function spt($n$) was introduced by Andrews as the weighted counting of partitions of $n$ with respect to the number of occurrences of the smallest part. In this survey, we summarize recent developments in the study of spt($n$), including con
Motivated by a recent work of Ache and Chang concerning the sharp Sobolev trace inequality and Lebedev-Milin inequalities of order four on the Euclidean unit ball, we derive such inequalities on the Euclidean unit ball for higher order derivatives. B