Strict log-concavity conjecture for the rank and crank of ordinary partitions

About 7 years old · traced to

Let N(m,n)N(m,n) and M(m,n)M(m,n) denote, respectively, the rank and crank counting functions for ordinary partitions of nn with statistic mm. Strict log-concavity conjecture. The following inequalities hold:

N(m,n)2>N(m−1,n)N(m+1,n)for n≥123 and ∣m∣≤n−72,N(m,n)^2 > N(m-1,n)N(m+1,n) \qquad\text{for } n\ge123 \text{ and } |m|\le n-72, M(m,n)2>M(m−1,n)M(m+1,n)for n≥125 and ∣m∣≤n−71.M(m,n)^2 > M(m-1,n)M(m+1,n) \qquad\text{for } n\ge125 \text{ and } |m|\le n-71.

These are recorded as analogous conjectural strict log-concavity statements for the rank and crank of ordinary partitions; the supplied text gives no proof or resolution.

References

Primary source

Kathrin Bringmann, Chris Jennings-Shaffer and Karl Mahlburg, “The Asymptotic Distribution of the Rank for Unimodal Sequences”, arXiv:1910.10790 (2019).

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.