A combinatorial correspondence related to Göllnitz’ (big) partition theorem and applications

Abstract

In recent work, Alladi, Andrews and Gordon discovered a key identity which captures several fundamental theorems in partition theory. In this paper we construct a combinatorial bijection which explains this key identity. This immediately leads to a better understanding of a deep theorem of Göllnitz, as well as Jacobi’s triple product identity and Schur’s partition theorem.