Related papers: Higher Order Tur\'an Inequalities for the Partitio…

We prove that the number $q(n)$ of partitions into distinct parts is log-concave for $n \geq 33$ and satisfies the higher order Tur\'an inequalities for $n\geq 121$ conjectured by Craig and Pun. In doing so, we establish explicit error…

We consider the higher order Tur\'an inequality and higher order log-concavity for sequences $\{a_n\}_{n \ge 0}$ such that \[ \frac{a_{n-1}a_{n+1}}{a_n^2} = 1 + \sum_{i=1}^m \frac{r_i(\log n)}{n^{\alpha_i}} + o\left( \frac{1}{n^{\beta}}…

Nicolas and DeSalvo and Pak proved that the partition function $p(n)$ is log concave for $n \geq 25$. Chen, Jia and Wang proved that $p(n)$ satisfies the third order Tur\'{a}n inequality, and that the associated degree 3 Jensen polynomials…

Heim, Neuhauser, and Tr\"oger recently established some inequalities for MacMahon's plane partition function $\mathrm{PL}(n)$ that generalize known results for Euler's partition function $p(n)$. They also conjectured that $\mathrm{PL}(n)$…

In the $1970$s, Nicolas proved that the partition function $p(n)$ is log-concave for $ n > 25$. In \cite{HNT21}, a precise conjecture on the log-concavity for the plane partition function $\func{pp}(n)$ for $n >11$ was stated. This was…

Let $U_{n,d}$ be the uniform matroid of rank $d$ on $n$ elements. Denote by $g_{U_{n,d}}(t)$ the Speyer's $g$-polynomial of $U_{n,d}$. The Tur\'{a}n inequality and higher order Tur\'{a}n inequality are related to the Laguerre-P\'{o}lya…

This paper deals with both the higher order Tur\'an inequalities and the Laguerre inequalities for quasi-polynomial-like functions -- that are expressions of the form $f(n)=c_l(n)n^l+\cdots+c_d(n)n^d+o(n^d)$, where $d,l\in\mathbb{N}$ and…

Bessenrodt and Ono, Chen, Wang and Jia, DeSalvo and Pak were the first to discover the log-subadditivity, log-concavity, and the third-order Tur\'{a}n inequality of partition function, respectively. Many other important partition statistics…

The paper aims to establish the Tur\'an inequalities, the Laguerre inequalities (order $2$), and the determinantal inequalities (order $3$) for $\Delta p(n)$ and $\Delta \bar{p}(n)$, where $\Delta f(n)$ is the first-order forward difference…

Let $\overline{p}(n)$ denote the overpartition funtion. Engel showed that for $n\geq2$, $\overline{p}(n)$ satisfied the Tur\'{a}n inequalities, that is, $\overline{p}(n)^2-\overline{p}(n-1)\overline{p}(n+1)>0$ for $n\geq2$. In this paper,…

The partition function $p(n)$ and many of its related restricted partition functions have recently been shown independently to satisfy log-concavity: $p(n)^2 \geq p(n-1)p(n+1)$ for $n\geq 26$, and satisfy the inequality: $p(n)p(m) \geq…

We prove that the partition function $p(n)$ is log-concave for all $n>25$. We then extend the results to resolve two related conjectures by Chen. The proofs are based on Lehmer's estimates on the remainders of the Hardy--Ramanujan and the…

In recent years, the log-concavity or log-convexity of combinatorial sequences and their root sequences, higher order Tur{\'a}n inequalities, and Laguerre inequalities of order two have been widely studied. However, the research of the…

The Tur{\'a}n inequalities and the Laguerre inequalities are closely related to the Laguerre-P\'{o}lya class and the Riemann hypothesis. These inequalities have been extensively studied in the literature. In this paper, we propose a method…

Let $\overline{p}(n)$ denote the overpartition function. In this paper, we study the asymptotic growth of finite difference of logarithm of $\sqrt[n]{\overline{p}(n)/n^{\alpha}}$ for $\alpha$ being a non-negative real number, namely…

We show how Turan's inequality $P_n(x)^2-P_{n-1}(x)P_{n+1}(x)\geq 0$ for Legendre polynomials and related inequalities can be proven by means of a computer procedure. The use of this procedure simplifies the daily work with inequalities.…

In 1918, Hardy and Ramanujan made a breakthrough by developing the circle method to deduce an asymptotic formula for the partition function $p(n)$, which was later refined by Rademacher in 1937 to produce an absolutely convergent series…

Let $p(n)$ denote the partition function. DeSalvo and Pak proved that $\frac{p(n-1)}{p(n)}\left(1+\frac{1}{n}\right)> \frac{p(n)}{p(n+1)}$ for $n\geq 2$, as conjectured by Chen. Moreover, they conjectured that a sharper inequality…

Let $g$ and $h$ be real-valued arithmetic functions, positive and normalized. Specific choices within the following general scheme of recursively defined polynomials \begin{equation*} P_n^{g,h}(x):= \frac{x}{h(n)} \sum_{k=1}^{n} g(k) \,…

The orthogonal polynomials $p_n$ satisfy Tur\'an's inequality if $p_n^2(x)-p_{n-1}(x)p_{n+1}(x)\ge 0$ for $n\ge 1$ and for all $x$ in the interval of orthogonality. We give general criteria for orthogonal polynomials to satisfy Tur\'an's…