Variations of Andrews-Beck type congruences (Q1995924)

A partition of a natural number \(n\) is a weakly decreasing sequence of positive integers whose sum is \(n\). In 1944, \textit{F.~Dyson} [Eureka, 8, 10--15 (1944)] introduced the rank of a partition as the largest part minus the number of parts, and conjectured that this statistic gives a combinatorial interpretation of Ramanujan's congruences for the partition function modulo 5 and 7. \textit{A. O. L. Atkin} and \textit{P. Swinnerton-Dyer} [Proc. Lond. Math. Soc. (3) 4, 84--106 (1954; Zbl 0055.03805)] confirmed Dyson's conjecture by establishing explicit formulas for the generating function of rank differences. Quite recently, utilizing these rank difference identities, \textit{G. E. Andrews} [Int. J. Number Theory (2020), in press] proved some surprising congruences (conjectured by George Beck) for \(NT(m,k,n)\), the total number of parts in the partitions of \(n\) with rank congruent to \(m\) modulo \(k\). One of results proved by Andrews is that for any \(n\geq0\) and \(i\in\{1,4\}\), \[ NT(1,5,5n+i) -NT(4,5,5n+i)+2NT(2,5,5n+i)-2NT(3,5,5n+i)\equiv0\pmod{5}.\tag{1} \] Let \(\overline{NT}(m,k,n)\) and \(\overline{NT2}(m,k,n)\) denote respectively the total number of parts in the overpartitions of \(n\) with rank and \(M_2\)-rank congruent to \(m\) modulo \(k\), and let \(NT2(m,k,n)\) denote the total number of partitions without repeated odd parts of \(n\) with \(M_2\)-rank congruent to \(m\) modulo \(k\). The authors prove that congruences similar to (1) also occur in aforementioned three kinds of partitions. For instance, the authors prove that for any \(n\geq0\), \[ \overline{NT2}(1,5,5n+2) -\overline{NT2}(4,5,5n+2)+2\overline{NT2}(2,5,5n+2)-2\overline{NT2}(3,5,5n+2)\equiv0\pmod{5} \] and \[ \overline{NT}(1,3,3n)-\overline{NT}(2,3,3n)-\overline{NT2}(1,3,3n) +\overline{NT2}(2,3,3n)\equiv0\pmod{3}. \] Also, they conjecture many congruences and relations for \(NT(m,k,n)\) and for a related crank-type function. For example, for any \(n\geq0\) and \(i\in\{0,4\}\), \begin{gather*} M_\omega(1,5,5n+4)-M_\omega(4,5,5n+4) +2M_\omega(2,5,5n+4)-2M_\omega(3,5,5n+4)=0,\\ NT(1,5,5n+4)-NT(4,5,5n+4) +2M_\omega(2,5,5n+i)-2M_\omega(3,5,5n+i)\equiv0\pmod{5}, \end{gather*} where \(M_\omega(m,k,n)\) denote the number of ones in the partitions of \(n\) with crank congruent to \(m\) modulo \(k\).