Papers
Topics
Authors
Recent
Search
2000 character limit reached

Turán Inequalities for Infinite Product Generating Functions

Published 19 Jul 2022 in math.CO and math.NT | (2207.09409v1)

Abstract: 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 recently proven by Ono, Pujahari, and Rolen. In this paper, we provide a general picture. We associate to double sequences ${g_d(n)}{d,n}$ with $g_d(1)=1$ and $$0 \leq g{d}\left( n\right) - n{d}\leq g_{1}\left( n\right) \left( n-1\right) {d-1}$$ polynomials ${P_n{g_d}(x)}_{d,n}$ given by \begin{equation*} \sum_{n=0}{\infty} P_n{g_d}(x) \, qn := \func{exp}\left( x \sum_{n=1}{\infty} g_d(n) \frac{qn}{n} \right) =\prod_{n=1}{\infty} \left( 1 - qn \right){-x f_d(n)}. \end{equation*} We recover $ p(n)= P_n{\sigma_1}(1)$ and $\func{pp}\left( n\right) = P_n{\sigma_2}(1)$, where $\sigma_d (n):= \sum_{\ell \mid n} \elld$ and $f_d(n)= n{d-1}$. Let $n \geq 6$. Then the sequence ${P_n{\sigma_d}(1)}_d$ is log-concave for almost all $d$ if and only if $n$ is divisible by $3$. Let $\func{id}(n)=n$. Then $P_n{\func{id}}(x) = \frac{x}{n} L_{n-1}{(1)}(-x)$, where $L_{n}{\left( \alpha \right) }\left( x\right) $ denotes the $\alpha$-associated Laguerre polynomial. In this paper, we invest in Tur\'an inequalities \begin{equation*} \Delta_{n}{g_d}(x) := \left( P_n{g_d}(x) \right)2 - P_{n-1}{g_d}(x) \, P_{n+1}{g_d}(x) \geq 0. \end{equation*} Let $n \geq 6$ and $0 \leq x < 2 - \frac{12}{n+4}$. Then $n$ is divisible by $3$ if and only if $\Delta_{n}{g_d}(x) \geq 0$ for almost all $d$. Let $n \geq 6$ and $n \not\equiv 2 \pmod{3}$. Then the condition on $x$ can be reduced to $x \geq 0$. We determine explicit bounds. As an analogue to Nicolas' result, we have for $g_1= \func{id}$ that $\Delta_{n}{\func{id}}(x) \geq 0$ for all $x \geq 0 $ and all $n$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.