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

In this paper, we present a generalization of one of the theorems in [G. E. Andrews, Partitions with parts separated by parity, \textit{Annals of Combinatorics} \textbf{23}(2019), 241 - 248], and give its bijective proof. Further variations of related partition functions are studied resulting in a number of interesting identities.

Five simple guidelines are proposed to compute the generating function for the nonnegative integer solutions of a system of linear inequalities. In contrast to other approaches, the emphasis is on deriving recurrences. We show how to use the guidelines strategically to solve some nontrivial enumeration problems in the theory of partitions and compositions. This includes a strikingly different approach to lecture hall-type theorems, with new $q$-series identities arising in th...

The $k$-measure of an integer partition was recently introduced by Andrews, Bhattacharjee and Dastidar. In this paper, we establish trivariate generating function identities counting both the length and the $k$-measure for partitions and distinct partitions, respectively. The $2$-measure case for partitions extends a result of Andrews, Bhattacharjee and Dastidar.

In this article we will derive a combinatorial formula for the partition function p(n). In the second part of the paper we will establish connection between partitions and q-binomial coefficients and give new interpretation for q-binomial coefficients.

We prove new double summation hypergeometric $q$-series representations for several families of partitions, including those that appear in the famous product identities of G\"ollnitz, Gordon, and Schur. We give several different proofs for our results, using bijective partitions mappings and modular diagrams, the theory of $q$-difference equations and recurrences, and the theories of summation and transformation for $q$-series. We also consider a general family of similar dou...

We use the $q$-binomial theorem, the $q$-Gauss sum, and the ${}_2\phi_1 \rightarrow {}_2\phi_2$ transformation of Jackson to discover and prove many new weighted partition identities. These identities involve unrestricted partitions, overpartitions, and partitions with distinct even parts. Smallest part of the partitions plays an important role in our analysis. This work was motivated in part by the research of Krishna Alladi.

The main result of the paper is the Fibonacci-like property of the partition function. The partition function $p(n)$ has a property: $p(n) \leq p(n-1) + p(n-2)$. Our result shows that if we impose certain restrictions on the partition, then the inequality becomes an equality. Furthermore, we extend this result to cases with a greater number of summands.

In a recent paper by the authors, a bounded version of Goellnitz's (big) partition theorem was established. Here we show among other things how this theorem leads to nontrivial new polynomial analogues of certain fundamental identities of Jacobi and Lebesgue. We also derive a two parameter extension of Jacobi's famous triple product identity.

We use the celebrated circle method of Hardy and Ramanujan to develop convergent formulae for counting a restricted class of partitions that arise from the G\"ollnitz--Gordon identities.

The study of partitions with parts separated by parity was initiated by Andrews in connection with Ramanujan's mock theta functions, and his variations on this theme have produced generating functions with a large variety of different modular properties. In this paper, we use Ingham's Tauberian theorem to compute the asymptotic main term for each of the eight functions studied by Andrews.