ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.