Higher-order Jensen-polynomial real-rootedness conjecture for the partition function

About 9 years old · traced to

Let p(n)p(n) denote the number of partitions of the positive integer nn. For a positive integer mm, define the Jensen polynomial

Jm,n(x)=∑k=0m(mk)p(n+k)xk.J_{m,n}(x)=\sum_{k=0}^m {m\choose k}p(n+k)x^k.

Partition-function Jensen-polynomial conjecture. For every positive integer m≥4m\geq 4, there exists a positive integer N(m)N(m) such that, for every n≥N(m)n\geq N(m), the polynomial Jm,n(x)J_{m,n}(x) has only real zeros.

This proposes eventual real-rootedness for all higher-degree Jensen polynomials of the partition function. The supplied text gives no resolution of the conjecture.

References

Primary source

William Y. C. Chen, Dennis X. Q. Jia and Larry X. W. Wang, “Higher Order Turán Inequalities for the Partition Function”, arXiv:1706.10245 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.