Some identities on Beck's partition statistics (Q6122736)

A partition \(\lambda\) of a nonnegative integer \(n\) is a sequence of positive integers \(\lambda_1\geq\lambda_2\geq\cdots\geq\lambda_k>0\) such that \(\sum_{i=1}^k\lambda_i=n\). The numbers \(\lambda_i\) are called the parts of \(\lambda\). To provide a combinatorial interpretation of Ramanujan's celebrated congruences on \(p(n)\), \textit{F. J. Dyson} [Eureka (Cambridge), 8, 10--15 (1944)] defined the rank of a partition \(\lambda\), which is the largest part of the partition minus the number of parts. He conjectured that this partition statistic can interpret Ramanujan's congruences modulo 5 and 7 combinatorially. However, it can not give a combinatorial interpretation for Ramanujan's congruence modulo \(11\). Therefore, Dyson further conjectured that there exists another partition statistic that he named ``crank'', which can interpret Ramanujan's congruence modulo \(11\) combinatorially. In 1988, this partition statistic was eventually discovered by \textit{G .E. Andrews} and \textit{F. G. Garvan} [Bull. Am. Math. Soc., New Ser. 18, No. 2, 167--171 (1988; Zbl 0646.10008)]. Recently, George Beck introduced two partition statistics \(NT(r,m,n)\) and \(M_\omega(r,m,n)\), which denote the total number of parts in the partitions of \(n\) with rank congruent to \(r\) modulo \(m\) and the total number of ones in the partitions of \(n\) with crank congruent to \(r\) modulo \(m\), respectively, that is, \begin{align*} NT(r,m,n) &:=\sum_{\substack{\lambda\vdash n\\ \textrm{rank}(\lambda)\equiv r\pmod{m}}}\#(\lambda),\\ M_\omega(r,m,n) &:=\sum_{\substack{\lambda\vdash n\\ \textrm{crank}(\lambda)\equiv r\pmod{m}}}\omega(\lambda), \end{align*} where \(\#(\lambda)\) and \(\omega(\lambda)\) denote the number of parts of \(\lambda\) and the number of ones in \(\lambda\). Beck posed the following conjectural congruences: \begin{align*} &NT(1,5,5n+i)+2NT(2,5,5n+i) -NT(3,5,5n+i)-NT(4,5,5n+i)\equiv0\pmod{5},\tag{1}\\ &\begin{multlined}NT(1,7,7n+j)+NT(2,7,7n+j) -NT(3,7,7n+j)\\ +NT(4,7,7n+j) -NT(5,7,7n+j)-NT(6,7,7n+j)\equiv0\pmod{7},\end{multlined}\tag{2} \end{align*} where \(i\in\{1,4\}\) and \(j\in\{1,5\}\). The congruences (1) and (2) were later confirmed by \textit{G. E. Andrews} [Int. J. Number Theory 17, No. 2, 239--249 (2021; Zbl 1465.11200)]. Later, \textit{S. Chern} [Int. J. Number Theory 18, No. 1, 141--163 (2022; Zbl 1491.11095)] proved several identities and many congruences modulo 5, 7, 11, and 13 on linear combinations of \(NT(r,m,n)\) and \(M_\omega(r,m,n)\). The objective of this paper is to derive some identities involving \(NT(r,5,n)\) and \(M_\omega(r,5,n)\). Two identities proved in the present paper are that \begin{align*} \sum_{n=0}^\infty &\,\big(M_\omega(1,5,5n)-M_\omega(4,5,5n) +3(NT(2,5,5n)-NT(3,5,5n))\big)q^n =5q\dfrac{(q^5;q^5)_\infty^3}{(q^2,q^3;q^5)_\infty^2},\\ \sum_{n=0}^\infty &\,\big(M_\omega(2,5,5n)-M_\omega(3,5,5n) -NT(2,5,5n)+NT(3,5,5n)\big)q^n =5q\dfrac{(q^5;q^5)_\infty^3}{(q^2,q^3;q^5)_\infty^2}. \end{align*} where \[ (a;q)_\infty:=\prod_{j=0}^\infty(1-aq^j). \] The main ingredients in the proofs of the main results are some \(q\)-series identities and some neat \(q\)-series manipulations.