Polygonal numbers and Rogers-Ramanujan-Gordon theorem (Q2039006)

The Rogers-Ramanujan-Gordon theorem asserts the equality \(A_{k,r}(n) = B_{k,r}(n)\) where \(A_{k,r}(n)\) is the number of partitions of \(n\) into parts not congruent to \(0,\pm r \bmod {(2k+1)}\) and \(B_{k,r}(n)\) is the number of partitions of the form \(n=b_1+b_2+\cdots+b_s\), where \(b_i-b_{i+k-1}\ge 2\), at most \(r-1\) of the \(b_i\) are equal to 1 and \(1\le r\le k\). This paper explores some properties of the numbers \(B_{k,r}\) related to Euler's partition function \(p(n)\). First, for \(n\ge 0\), \[B_{k,r}(n) = \sum_{j=-\infty}^\infty (-1)^j p(n-P(2k+3,j)-j(r-1)),\] where \(P(k,n) - ((k-2)n^2-(k-4)n)/2\) is the \(n\)th \(k\)-polygonal number. Next, the sign of a truncated form of this identity is determined by \[(-1)^{t-1} \bigg( B_{k,r}(n) - \sum_{j=-t}^t (-1)^j p(n-P(2k+3,j)-j(r-1) \bigg) \ge 0)\] with strict inequality if \(n\) exceeds a certain explicit function of \(k\) and \(r\). These results are deduced from manipulations with \(q\)-series identities. Finally, from [\textit{M. Merca} and \textit{J. Katriel}, Ramanujan J. 51, No. 2, 245--266 (2020; Zbl 1434.05014)], the sign of \[(-1)^{t-1} \sum_{j=-(t-1)}^t (-1)^jp(n-P(2k+3,j)-j(r-1)) \] is the same as that of \((-1)^{t-1} \sum_{j=-(t-1)}^t (-1)^j (-P(2k+3,j)-j(r-1))\) for \(n\) sufficiently large and the latter is readily shown to be positive. The author conjectures a similar infinite family of linear partition inequalities for \(B_{k,r}(n)\) under certain conditions.