Tur\'an Inequalities for Infinite Product Generating Functions
Abstract
In the 1970s, Nicolas proved that the partition function p(n) is log-concave for n > 25. In HNT21, a precise conjecture on the log-concavity for the plane partition function 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 \gd(n)\d,n with gd(1)=1 and 0 ≤ gd( n) - nd≤ g1( n) ( n-1) d-1 polynomials \Pngd(x)\d,n given by equation* Σn=0∞ Pngd(x) \, qn := exp( x Σn=1∞ gd(n) qnn ) =Πn=1∞ ( 1 - qn )-x fd(n). equation* We recover p(n)= Pnσ1(1) and pp( n) = Pnσ2(1), where σd (n):= Σ n d and fd(n)= nd-1. Let n ≥ 6. Then the sequence \Pnσd(1)\d is log-concave for almost all d if and only if n is divisible by 3. Let id(n)=n. Then Pnid(x) = xn Ln-1(1)(-x), where Ln( α ) ( x) denotes the α-associated Laguerre polynomial. In this paper, we invest in Tur\'an inequalities equation* ngd(x) := ( Pngd(x) )2 - Pn-1gd(x) \, Pn+1gd(x) ≥ 0. equation* Let n ≥ 6 and 0 ≤ x < 2 - 12n+4. Then n is divisible by 3 if and only if ngd(x) ≥ 0 for almost all d. Let n ≥ 6 and n 2 3. Then the condition on x can be reduced to x ≥ 0. We determine explicit bounds. As an analogue to Nicolas' result, we have for g1= id that nid(x) ≥ 0 for all x ≥ 0 and all n.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.