A four parameter generalization of Gollnitz's (BIG) partition theorem

In this work we define a unified generating functions for 9 different kinds of set partitions including cyclically ordered set partitions. Such generating function depends on 4 parameters. We consider property of this function and provide combinatorial explanation for polynomials generated by this function. Two new combinatorial statistics are defined and the explicit formulae given for coefficients of parametrized polynomials defined by the generating function.

We present a dual of a family of partition identities of Andrews involving partitions with no repeated odd parts (among other conditions), along with an overpartition generalization that encapsulates both families. These were discovered during the course of research for an upcoming article by the authors along with Debajyoti Nandi. The proof uses Appell's comparison theorem.

A Goellnitz-Gordon partition is one in which the parts differ by at least 2, and where the inequality is strict if a part is even. Let Q_i(n) denote the number of partitions of n into distinct parts not congruent to i mod 4. By attaching weights which are powers of 2 and imposing certain parity conditions on Goellnitz-Gordon partitions, we show that these are equinumerous with Q_i(n) for i=0,2. These complement results of Goellnitz on Q_i(n) for i=1,3, and of Alladi who provi...

In this paper, we give a purely bijective proof that two different partition classes that are both combinatorial interpretations of the partition function $p_\nu(n)$, a partition function related to the third order mock theta function $\nu(q)$, are equinumerous. In doing so, we give a partial solution to a combinatorial problem proposed in a paper by Andrews.

We prove an identity about partitions with a very elementary formulation. We had previously conjectured this identity, encountered in the study of shifted Jack polynomials (math.CO/9901040). The proof given is using a trivariate generating function. It would be interesting to obtain a bijective proof. We present a conjecture generalizing this identity.

This paper will primarily present a method of proving generating function identities for partitions from linked partition ideals. The method we introduce is built on a conjecture by George Andrews and that those generating functions satisfy some $q$-difference equations. We will come up with the generating functions of partitions in the Kanade--Russell conjectures to illustrate the effectiveness of this method.

In this paper we give an analytic proof of the identity $A_{5,3,3}(n) =B^0_{5,3,3}(n)$, where $A_{5,3,3}(n)$ counts the number of partitions of $n$ subject to certain restrictions on their parts, and $B^0_{5,3,3}(n)$ counts the number of partitions of $n$ subject to certain other restrictions on their parts, both too long to be stated in the abstract. Our proof establishes actually a refinement of that partition identity. The original identity was first discovered by the firs...

Recently, Andrews gave a detailed study of partitions with even parts below odd parts in which only the largest even part appears an odd number of times. In this paper, we provide a combinatorial proof of the generating function identity of such partitions. We also have a further investigation on the largest even part. Finally, we give an interesting weighted overpartition generalization.

By considering a limiting form of the q-Dixon_4\phi_3 summation, we prove a weighted partition theorem involving odd parts differing by >= 4. A two parameter refinement of this theorem is then deduced from a quartic reformulation of Goellnitz's (Big) theorem due to Alladi, and this leads to a two parameter extension of Jacobi's triple product identity for theta functions. Finally, refinements of certain modular identities of Alladi connected to the Goellnitz-Gordon series are...

Bressoud introduced the partition function $B(\alpha_1,\ldots,\alpha_\lambda;\eta,k,r;n)$, which counts the number of partitions with certain difference conditions. Bressoud posed a conjecture on the generating function for the partition function $B(\alpha_1,\ldots,\alpha_\lambda;\eta,k,r;n)$ in multi-summation form. In this article, we introduce a bijection related to Bressoud's conjecture. As an application, we give a new companion to the G\"ollnitz-Gordon identities.