Pairs of partitions without repeated odd parts (Q439277)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Pairs of partitions without repeated odd parts
scientific article

    Statements

    Pairs of partitions without repeated odd parts (English)
    0 references
    0 references
    0 references
    1 August 2012
    0 references
    The authors prove the identities \[ \sum_{n \geq 0} \frac{(x,1/x)_nq^n}{(zq,q/z)_n} = \frac{(1-z)^2}{(1-z/x)(1-xz)} + \frac{z(x,1/x)_{\infty}}{(1-z/x)(1-xz)(zq,q/z)_{\infty}} \] and \[ \sum_{n \geq 0} \frac{(x,q/x)_nq^n}{(z,q/z)_{n+1}} = \frac{1}{x(1-z/x)(1-q/(xz))} + \frac{(x,q/x)_{\infty}}{z(1-x/z)(1-q/(xz))(z,q/z)_{\infty}}. \] Here we have used standard \(q\)-series notation. The proofs depend on previous work of the first author [Proc. Lond. Math. Soc. (3) 91, No. 3, 598--622 (2005; Zbl 1089.33012)] together with the Watson-Whipple transformation. A number of corollaries are recorded, some of which contain the infinite product \[ \frac{(-q;q^2)_{\infty}^2}{(zq^2,q^2/z;q^2)_{\infty}^2}. \] This leads to a discussion of ranks for partition pairs without repeated odd parts. The authors define three of these, describe what each counts, and show that each provides a combinatorial interpretation for the congruence \[ tt(3n+2) \equiv 0 \pmod{3}, \] where \(tt(n)\) is the number of partition pairs of \(n\) without repeated odd parts.
    0 references
    0 references
    \(q\)-series identities
    0 references
    partition pairs
    0 references
    rank
    0 references
    congruence
    0 references
    0 references