Search arXivSearch

arXiv · 1706.10245

Higher Order Turán Inequalities for the Partition Function

Abstract

The Turán inequalities and the higher order Turán inequalities arise in the study of Maclaurin coefficients of an entire function in the Laguerre-Pólya class. A real sequence $\{a_{n}\}$ is said to satisfy the Turán inequalities if for $n\geq 1$, $a_n^2-a_{n-1}a_{n+1}\geq 0$. It is said to satisfy the higher order Turán inequalities if for $n\geq 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})^2\geq 0$. A sequence satisfying the Turán 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án inequalities for $n\geq 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\geq 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 $m\geq 4$ there exists an integer $N(m)$ such that for $n\geq N(m) $, the polynomials $\sum_{k=0}^m {m\choose k}p(n+k)x^k$ have only real zeros. This conjecture was independently posed by Ono.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

William Y. C. Chen, Dennis X. Q. Jia, Larry X. W. Wang. 2017-06-30. Higher Order Turán Inequalities for the Partition Function. https://arxiv.org/abs/1706.10245

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO