Andrews-Beck type congruences modulo arbitrary powers of 5 for 2-colored partitions (Q6591612)

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 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)].\N\NRecently, George Beck defined 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,\N\begin{align*}\NNT(r,m,n) &:=\sum_{\substack{\lambda\vdash n\\ \operatorname{rank}(\lambda)\equiv r\pmod{m}}}\#(\lambda),\\\NM_\omega(r,m,n) &:=\sum_{\substack{\lambda\vdash n\\ \operatorname{crank}(\lambda)\equiv r\pmod{m}}}\omega(\lambda),\N\end{align*}\Nwhere \(\#(\lambda)\) and \(\omega(\lambda)\) denote the number of parts of \(\lambda\) and the number of ones in \(\lambda\). Beck posed the following conjectural congruences:\N\begin{align*}\N&NT(1,5,5n+i)+2NT(2,5,5n+i)\\\N&\qquad -NT(3,5,5n+i)-NT(4,5,5n+i)\equiv0\pmod{5},\tag{1}\\\N&NT(1,7,7n+j)+NT(2,7,7n+j)\\\N&\qquad-NT(3,7,7n+j)+NT(4,7,7n+j)\\\N&\qquad-NT(5,7,7n+j)-NT(6,7,7n+j)\equiv0\pmod{7},\tag{2}\N\end{align*}\Nwhere \(i\in\{1,4\}\) and \(j\in\{1,5\}\). The congruences \((1)\) and \((2)\) were confirmed by \textit{G. E. Andrews} [Int. J. Number Theory 17, No. 2, 239--249 (2021; Zbl 1465.11200)].\N\NMotivated by these work, \textit{B. L. S. Lin}, \textit{L. Peng} and \textit{P. Toh} [Discrete Math. 344, No. 8, Article ID 112450, 13 p. (2021; Zbl 1478.11122)] considered the generalized crank for \(k\)-colored partitions, which was defined by \textit{S. Fu} and \textit{D. Tang} [J. Number Theory 184, 485--497 (2018; Zbl 1420.11130)], where \(k\geq2\). A \(k\)-colored partition \(\lambda\) of a positive integer \(n\) is a \(k\)-tuple of partitions \(\lambda:=\big(\lambda^{(1)},\lambda^{(2)},\ldots, \lambda^{(k)}\big)\) such that \(|\lambda^{(1)}|+|\lambda^{(2)}|+\cdots +|\lambda^{(k)}|=n\). If \(\lambda\) is a \(k\)-colored partition of \(n\), we denote it by \(\lambda\vdash n\). Fu and Tang defined a generalized crank for \(k\)-colored partitions by\N\[\N\operatorname{crank}_k(\lambda)=\#\big(\lambda^{(1)}\big) -\#\big(\lambda^{(2)}\big).\N\]\NLet \(r\), \(m\), \(n\), \(k\) be integers with \(m\geq1\), \(k\geq2\), \(n\geq1\) and \(0\leq r\leq m-1\). Define\N\[\NN\!B_k(r,m,n):=\sum_{\substack{\lambda\vdash n\\ \operatorname{crank}_k(\lambda) \equiv r\pmod{m}}}\#\big(\lambda^{(1)}\big).\N\]\NLin, Peng, and Toh proved many Andrews-Beck type congruences for \(N\!B_k(r,m,n)\). For example, they prove that for any \(n\geq0\),\N\[\N\sum_{m=1}^4mN\!B_2(m,5,5n+i) \equiv0\pmod{5},\N\]\Nwhere \(i\in\{0,2,3,4\}\).\N\NIn this paper, the authors prove several infinite families of congruences modulo high powers of \(5\) satisfied by \(N\!B_2(m,5,5n+3)\). For example, they proved that for any \(\alpha\geq1\) and \(n\geq0\),\N\[\NN\!B_2\big(1,5,5^{\alpha+1}n+5\delta_\alpha+3\big)-N\!B_2\big(4,5,5^{\alpha+1}n +5\delta_\alpha+3\big) \equiv0\pmod{5^{\lceil(\alpha+1)/2\rceil}},\N\]\Nwhere\N\[\N\delta_\alpha=\begin{cases} \frac{7\times5^\alpha-7}{12} &\text{if }\alpha \text{ is even},\\\N\frac{11\times5^\alpha-7}{12} &\text{if }\alpha \text{ is odd}. \end{cases}\N\]\NAnother example presented in this paper is that for any \(\alpha\geq1\) and \(n\geq0\),\N\[\NN\!B_2\big(1,5,5^{\alpha+1}A+5\delta_\alpha+3\big)-N\!B_2\big(4,5,5^{\alpha+1}A +5\delta_\alpha+3\big) \equiv0\pmod{5^{\alpha/2+1}},\N\]\Nwhere \(\delta_\alpha\) is defined as in above, each \(p_i\) is a prime with \(p_i\equiv5\pmod{6}\), \(n\not\equiv0\pmod{p_{k+1}}\) and\N\[\NA=p_1^2p_2^2\cdot p_k^2p_{k+1}n+\dfrac{7\big(p_1^2p_2^2\cdots p_k^2p_{k+1}^2-1\big)} {12}.\N\]