相关论文: Variation on a theme of Nathan Fine. New weighted …
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,…
This work follows the spirit of Andrews' series of papers on Partition Analysis. In $2011$, Savage and Sills found new sum sides for the little G\"ollnitz identities and provided their partition interpretations. It turns out that similar…
In this paper we refine a weighted partition identity of Alladi. We write explicit formulas of generating functions for the number of partitions grouped with respect to a partition statistic other than the norm. We tie our weighted results…
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…
Recently Corteel and Welsh outlined a technique for finding new sum-product identities by using functional relations between generating functions for cylindric partitions and a theorem of Borodin. Here, we extend this framework to include…
This paper has a two-fold purpose. First, by considering a reformulation of a deep theorem of G\"ollnitz, we obtain a new weighted partition identity involving the Rogers-Ramanujan partitions, namely, partitions into parts differing by at…
Dedicated to George E. Andrews on the occasion of his 70th birthday. Submitted to a special issue for this occasion. We use Andrews' notion of a `signed partition' (i.e. partition where some parts are allowed to be negative) to interpret…
Noting a curious link between Andrews' even-odd crank and the Stanley rank, we adopt a combinatorial approach building on the map of conjugation and continue the study of integer partitions with parts separated by parity. Our motivation is…
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…
The partition function $p(n)$, which counts the number of partitions of a positive integer $n$, is widely studied. Here, we study partition functions $p_S(n)$ that count partitions of $n$ into distinct parts satisfying certain congruence…
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.
We find two involutions on partitions that lead to partition identities for Ramanujan's third order mock theta functions $\phi(-q)$ and $\psi(-q)$. We also give an involution for Fine's partition identity on the mock theta function f(q).…
Alladi studied partition theoretic implications of a two variable generalization of the Lebesgue identity. In this short note, we focus on a slight variation of the basic hypergeometric sum that Alladi studied. We present two new partition…
Refined versions, analytic and combinatorial, are given for classical integer partition theorems. The examples include the Rogers-Ramanujan identities, the Gollnitz-Gordon identities, Euler's odd=distinct theorem, and the Andrews-Gordon…
Let $\mathscr{S}$ denote the set of integer partitions into parts that differ by at least $3$, with the added constraint that no two consecutive multiples of $3$ occur as parts. We derive trivariate generating functions of Andrews--Gordon…
We find an involution as a combinatorial proof of a Ramanujan's partial theta identity. Based on this involution, we obtain a Franklin type involution for squares in the sense that the classical Franklin involution provides a combinatorial…
In this paper, we find an identity which connects the overpartition function and the function of Rogers--Ramanujan--Gordon type overpartitions by considering the weights and gaps. This identity can be seen as an analogue of the weighted…
In this paper, we establish that the number of partitions of a natural number with positive odd rank is equal to the number of two-color partitions (red and blue), where the smallest part is even (say $2n$) and all red parts are even and…
The generating function of partitions with repeated (resp. distinct) parts such that each odd part is less than twice the smallest part is shown to be the third order mock theta function $\omega(q)$ (resp. $\nu(-q)$). Similar results for…
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…