Polynomial identities implying Capparelli's partition theorems (Q2631688): Difference between revisions

A partition \(\pi\) of an integer \(n\) is a non-increasing finite sequence of positive integers \((\pi_1, \pi_2,\ldots, \pi_k)\) whose sum is \(n\). The \(\pi_i\) are called the parts of the partition \(\pi\). By convention, the empty sequence is the only partition of \(0\). Let \(C_m(n)\) denote the number of partitions of \(n\) into distinct parts where no part is congruent to \(\pm m\) modulo \(6\). Let \(D_m(n)\) denote the number of partitions of \(n\) into parts, not equal to \(m\), where the difference of two consecutive parts is greater than or equal to \(2\), and is exactly \(2\) or \(3\) only if the consecutive parts are \(3k\) and \(3k+3\), or \(3k-1\) and \(3k+1\) for some \(k\in\mathbb{Z}_{>0}\). Capparelli's partition theorems state that \(C_m(n)=D_m(n)\) for any non-negative integer \(n\) and \(m\in\{1,2\}\). In this paper, the authors present and recursively prove polynomial identities that imply Capparelli's partition theorems. In addition, they also provide combinatorial interpretations of some of their expressions.