Linked partition ideals and a family of quadruple summations (Q6133630)

The authors prove the following trivariate Rogers-Ramanujan type identity: \begin{align*} (-xq;q^2)_{\infty} (-yq^2;q^4)_{\infty} = \sum_{n_1,n_2,n_3,n_4 \geq 0} \frac{x^{n_1+n_2+2n_4}y^{n_2+n_3}q^{n_1+3n_2+2n_3+4n_4}(1+x^2yq^{6+8(n_1+n_2+n_3+n_4)})}{(q^2;q^2)_{n_1}(q^2;q^2)_{n_2}(q^4;q^4)_{n_3}(q^4;q^4)_{n_4}} \\ \times q^{4\binom{n_1}{2} + 6\binom{n_2}{2} + 4\binom{n_3}{2} + 8\binom{n_4}{2} + 4n_1n_2 + 4n_1n_3 + 4n_1n_4 + 4n_2n_3 + 4n_2n_4 + 4n_3n_4}. \end{align*} Here, \((a;q)_n = \prod_{k=0}^{n-1} (1-aq^k)\) is the \(q\)-Pochhammer symbol as usual. This identity is used to obtain a combinatorial relation, unifying earlier results of Andrews, on \(4\)-regular partitions and overpartitions. Here, a partition is called \(k\)-regular if none of its parts is divisible by \(k\), and an overpartition is a partition where the first occurrence of each distinct part may be overlined. Let \(\mathcal{A}_{\{1\}}^{\veebar}\) be the set of overpartitions with the following two properties: \begin{itemize} \item[1.] Only odd parts larger than \(1\) may be overlined. \item[2.] The difference between any two parts is \(\geq 4\), and the inequality is strict if the larger one is overlined or divisible by \(4\), with the exception that \(\overline{5}\) and \(1\) may simultaneously appear as parts. \end{itemize} For an (over-)partition \(\lambda\), we write \(\#_{a,M}(\lambda)\) for the number of parts in \(\lambda\) that are congruent to \(a\) modulo \(M\). Moreover, \(O(\lambda)\) denotes the number of overlined parts in an overpartition \(\lambda\). Now the following holds: Theorem. Let \(A(n; m, \ell)\) be the number of overpartitions \(\lambda\) of \(n\) in the set \(\mathcal{A}_{\{1\}}^{\veebar}\) that satisfy \(\#_{1,2}(\lambda) + 2\#_{0,4}(\lambda) = m\) and \(\#_{2,4}(\lambda) + O(\lambda) = \ell\). Moreover, let \(B(n; m, \ell)\) be the number of \(4\)-regular partitions of \(n\) into distinct parts, of which \(m\) are odd and \(\ell\) even. Then we have \[ A(n; m, \ell) = B(n; m, \ell). \]