Beyond Göllnitz' theorem. I: A bijective approach (Q5918943)

Answering a longstanding question of how to go beyond a classical theorem of \textit{H. Göllnitz} [J. Reine Angew. Math. 225, 154--190 (1967; Zbl 0166.00803)], which uses three primary and three secondary colors, \textit{K. Alladi} et al. [Invent. Math. 153, No. 2, 231--260 (2003; Zbl 1097.05006)] proved an identity for partitions where parts occur in eleven colors: four primary colors, six secondary colors, and one quaternary color. The main tool of this paper was a difficult four parameter \(q\)-series identity. In this extended abstract, the author uses a different approach by introducting forbidden patterns and giving a bijective proof of a ten-colored partition identity lying beyond Göllnitz' theorem. Using a second bijection it was shown that this ten-colored partition identity is equivalent to the identity of Alladi et al. [loc. cit.]. In fact, in the second paper of this series [\textit{I. Konan}, ``Beyond Göllnitz' theorem. II: Arbitrarily many primary colors'', Preprint, \url{arXiv:1912.06702}] the author shows how his method can be used to go beyond Göllnitz' theorem for any number of primary colors.