Remarks on MacMahon's q-series
Abstract
In his important 1920 paper on partitions, MacMahon defined the partition generating functions align* Ak(q)=Σn=1∞m(k;n)qn&:=Σ0< s1<s2<·s<sk qs1+s2+·s+sk(1-qs1)2(1-qs2)2·s(1-qsk)2,\\ Ck(q)=Σn=1∞ modd(k;n)qn&:=Σ0< s1<s2<·s<sk q2s1+2s2+·s+2sk-k(1-q2s1-1)2(1-q2s2-1)2·s(1-q2sk-1)2. align* These series give infinitely many formulas for two prominent generating functions. For each non-negative k, we prove that Ak(q), Ak+1(q), Ak+2(q),… (resp. Ck(q), Ck+1(q), Ck+2(q),…) give the generating function for the 3-colored partition function p3(n) (resp. the overpartition function p(n)).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.