The dual of Göllnitz's (big) partition theorem (Q2254868): Difference between revisions

The authors prove a new companion to Göllnitz's big partition theorem; namely, it is shown that the following are equal: {\parindent=6mm \begin{itemize}\item[1.] The number of partitions of an integer \(n\) into parts that are congruent to 1, 7 or 10 modulo 12. \item[2.] The number of partitions of \(n\) into distinct parts that are congruent to 1, 2 or 4 modulo 6. \item[3.] The number of partitions of \(n\) into parts that differ by at least 6, where the inequality is strict if the larger part is congruent to 0, 3 or 5 modulo 6, with the exception that 6+1 may appear in the partition. \end{itemize}} The authors give a \(q\)-theoretic proof and put the identity into a greater context. They establish the key identity that represents this partition theorem on an analytic level and also provide a three parameter refinement involving vector partitions.