Weaker Q2Q_2 truncated-sum inequality

From papers

For any nonnegative integer nn, define

γn={ρm,if n=m(m+1), mN0,0,otherwise.\gamma_n=\begin{cases}\rho_m,&\text{if }n=m(m+1),\ m\in\mathbb N_0,\\0,&\text{otherwise.}\end{cases}

Let Q2(n)Q_2(n) denote the partition function in the source. Weaker Q2Q_2 truncated-sum inequality. For n0n\geqslant0 and k>0k>0,

(1)k1(γnj=kk(1)jQ2(nj(3j1)/2))0.(-1)^{k-1}\left(\gamma_n-\sum_{j=-k}^k(-1)^jQ_2\bigl(n-j(3j-1)/2\bigr)\right)\geqslant0.

The source explicitly describes this as weaker than the preceding Q2Q_2 conjecture; it remains open.

Progress summary

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

Sources & referencesView supporting material

Primary source

Cristina Ballantine and Mircea Merca, “6-regular partitions: new combinatorial properties, congruences, and linear inequalities”, arXiv:2302.01253 (2023).

Solutions 0

No solutions have been posted yet.