Even-odd partition identities of Rogers-Ramanujan type (Q2115267)

A major ingredient of the theory of partitions is the study of partition identities, an identity between the number of partitions of an integer \(n\) satisfying a property \(P_1\) and the number of partitions of \(n\) satisfying another property \(P_2\). Two of the most famous partition identities are the Rogers-Ramanujan identities. To be more precise, for \(i=1\), \(2\), let \(B_{2,i}(n)\) denote the number of partitions of \(n\) with distinct parts, no consecutive parts and at most \((i-1)\) parts equal to \(1\), and let \(A_{2,i}(n)\) denote the number of partitions of \(n\) into parts \(\not\equiv0,\pm i\pmod{5}\). Then, \(A_{2,i}(n)=B_{2,i}(n)\) holds for any \(n\geq0\). In this paper, the author proves a theorem which adds a new companion to the Rogers-Ramanujan identities. To state this new companion, we first introduce some notation. Let \(n\) be a nonnegative integer and \(\Lambda=\lambda_1+\lambda_2+\cdots+\lambda_n\) \((\lambda_1\geq\lambda_2\geq\cdots\geq\lambda_n)\) be a partition of \(n\). We regroup the even parts (the odd parts) of \(\Lambda\) together and denote them by \(\lambda_{i_1}\geq\lambda_{i_2}\geq\cdots\geq\lambda_{i_{r_1}}\) (\(\lambda_{j_1}\geq\lambda_{j_2}\geq\cdots\geq\lambda_{j_{r_2}}\)). For \(i=1\), \(2\), let \(P_{2,i}(n)\) denote the number of partitions of \(n\) with at most \((i-1)\) parts equal to \(1\), whose smallest even part is no less than two times its length, and whose odd parts satisfy \(\lambda_{j_\ell}-\lambda_{j_{\ell+2}}\geq4\). The author proves that \(P_{2,i}(n)=A_{2,i}(n)=B_{2,i}(n)\) holds for any \(n\geq0\), where \(A_{2,i}(n)\) and \(B_{2,i}(n)\) are the same as in the Rogers-Ramanujan identities. Finally, the author generalizes the equality \(P_{2,i}(n)=B_{2,i}(n)\) and then derives two families of partition identities. For instance, for any nonnegative integer \(k\), and \(i=1\), \(2\), let \(P_{2,i}^{2k+1}(n)\) denote the number of partitions of \(n\) whose parts are no less than \(2k+1\), with at most \((i-1)\) parts equal to \(2k+1\), whose smallest even part is no less than two times its length plus \(k\), and whose odd parts satisfy \(\lambda_{j_\ell}-\lambda_{j_{\ell+2}}\geq4\), and let \(B_{2,i}^{2k+1}(n)\) denote the number of partitions of \(n\) whose parts are no less than \(2k+1\) and without equal or consecutive parts. Then \(P_{2,i}^{2k+1}(n)=B_{2,i}^{2k+1}(n)\) holds for any \(n\geq0\).