Remarks on MacMahon's $q$-series
Combinatorics
2024-05-20 v2
Abstract
In his important 1920 paper on partitions, MacMahon defined the partition generating functions \begin{align*} A_k(q)=\sum_{n=1}^{\infty}\mathfrak{m}(k;n)q^n&:=\sum_{0< s_1<s_2<\cdots<s_k} \frac{q^{s_1+s_2+\cdots+s_k}}{(1-q^{s_1})^2(1-q^{s_2})^2\cdots(1-q^{s_k})^2},\\ C_k(q)=\sum_{n=1}^{\infty} \mathfrak{m}_{odd}(k;n)q^n&:=\sum_{0< s_1<s_2<\cdots<s_k} \frac{q^{2s_1+2s_2+\cdots+2s_k-k}}{(1-q^{2s_1-1})^2(1-q^{2s_2-1})^2\cdots(1-q^{2s_k-1})^2}. \end{align*} These series give infinitely many formulas for two prominent generating functions. For each non-negative , we prove that (resp. ) give the generating function for the 3-colored partition function (resp. the overpartition function ).
Keywords
Cite
@article{arxiv.2402.08783,
title = {Remarks on MacMahon's $q$-series},
author = {Ken Ono and Ajit Singh},
journal= {arXiv preprint arXiv:2402.08783},
year = {2024}
}
Comments
Minor revisions based on two referee report