Rogers-Ramanujan identities for partitions with ''n copies of n'' (Q1088988)

The authors have proved partition identities for a class of objects related to the plane partitions. Let M be the set of ordered pairs of positive integers with the second entry not exceeding the first and totally ordered lexicographically: \[ 1_ 1<2_ 1<2_ 2<3_ 1<3_ 2<3_ 3<.... \] \(\pi\) is a partition of \(\nu\) with n copies of n if \(\pi\) is a finite collection of elements of M (possibly with repetitions) if the first members of the ordered pair in \(\pi\) add up to \(\nu\). Let \(P_ M(\nu)\) denote the number of partitions of \(\nu\) with n copies of n (different colors), then \[ 1+\sum^{\infty}_{\nu =1}P_ M(\nu)q^{\nu}=\prod^{\infty}_{n=1}\frac{1}{(1-q^ n)^ n}. \] The right hand side is also the generating function for plane partitions. The weighted difference \(((m_ i-n_ j))\) of two elements \(m_ i\), \(n_ j\) of M, \(m\geq n\) is defined by \(((m_ i-n_ j))=m-n-i-j\). The main theorem is the following: Let \(A_ 0(k,\nu)\) denote the number of partitions of \(\nu\) with n copies of n such that the weighted difference of any pair of summands \(m_ i\), \(r_ j\) is nonpositive, then it is even and \(((m_ i-r_ j))\geq -2 \min (i-1,j-1,k-3)\). Let \(B_{\ell}(k,\nu)\) denote the number of partitions (ordinary) of \(\nu\) into parts \(\not\equiv 0\), \(\pm 2(k-\ell)mod (4k+2)\), then \(A_ 0(k,\nu)=B_ 0(k,\nu)\) for all \(\nu\geq 0\) and \(k\geq 2\). The cases \(k=2\) or 3 are stated as two theorems.