The \(M_{2}\)-rank of partitions without repeated odd parts modulo 6 and 10 (Q2346604)

The \(M_2\)-rank of a partition \(\lambda\) without repeated odd parts, first introduced by \textit{A. Berkovich} and \textit{F. G. Garvan} [J. Comb. Theory, Ser. A 100, No. 1, 61--93 (2002; Zbl 1016.05003)], can be defined as the number \[ M_2-\text{rank}(\lambda)=\left\lceil\frac{l(\lambda)}{2}\right\rceil-\nu(\lambda), \] where \(l(\lambda)\) is the largest part of \(\lambda\), \(\nu(\lambda)\) is the number of parts of \(\lambda\), and \(\lceil\cdot\rceil\) is the ceiling function. Let \(N_2(s,l,n)\) denote the number of partitions of \(n\) without repeated odd parts whose \(M_2\)-rank is congruent to \(s\) modulo \(l\). In the paper under review, the author derives generating functions for \(N_2(s_1,l,n)+N_2(s_2,l,n)-N_2(s_3,l,n)-N_2(s_4,l,n)\), for \(l=6\) and \((s_1,s_2,s_3,s_4)=(0,1,2,3)\), and for \(l=10\) and \((s_1,s_2,s_3,s_4)\) one of the vectors \((0,1,4,5)\) or \((1,2,3,4)\). Using these generating functions and some results from [\textit{J. Lovejoy} and \textit{R. Osburn}, J. Théor. Nombres Bordx. 21, No. 2, 313--334 (2009; Zbl 1270.11103)], the author establishes several inequalities between \(M_2\)-ranks modulo 3,5,6, and 10 of partitions without repeated parts.