6-regular partition truncated-sum inequality

From papers

For any integer nn, define

αn={(1)m,if n=3m(3m1), mZ,0,otherwise.\alpha_n=\begin{cases}(-1)^m,&\text{if }n=3m(3m-1),\ m\in\mathbb Z,\\0,&\text{otherwise.}\end{cases}

Let b6(n)b_6(n) denote the 66-regular partition function. 6-regular partition inequality. For n0n\geqslant0 and k>0k>0,

(1)k(αnj=(k1)k(1)jb6(nj(3j1)/2))0,(-1)^k\left(\alpha_n-\sum_{j=-(k-1)}^k(-1)^jb_6\bigl(n-j(3j-1)/2\bigr)\right)\geqslant0,

with strict inequality if nk(3k+1)/2n\geqslant k(3k+1)/2.

This is the combinatorial interpretation of a proposed coefficient-sign and nonvanishing property for a truncated pentagonal-number series associated with 66-regular partitions; 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.