Higher Order Tur\'an Inequalities for the Partition Function

Abstract

The Tur\'an inequalities and the higher order Tur\'an inequalities arise in the study of Maclaurin coefficients of an entire function in the Laguerre-P\'olya class. A real sequence \an\ is said to satisfy the Tur\'an inequalities if for n≥ 1, an2-an-1an+1≥ 0. It is said to satisfy the higher order Tur\'an inequalities if for n≥ 1, 4(an2-an-1an+1)(an+12-anan+2)-(anan+1-an-1an+2)2≥ 0. A sequence satisfying the Tur\'an 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\'an inequalities for n≥ 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 n≥ 95, the Jensen polynomials g3,n-1(x)=p(n-1)+3p(n)x+3p(n+1)x2+p(n+2)x3 have only real zeros. We conjecture that for any positive integer m≥ 4 there exists an integer N(m) such that for n≥ N(m) , the polynomials Σk=0m m kp(n+k)xk have only real zeros. This conjecture was independently posed by Ono.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…