Sang, Shi and Yee, in 2020, found overpartition analogs of Andrews' results involving parity in Rogers-Ramanujan-Gordon identities. Their result partially answered an open question of Andrews'. The open question was to involve parity in overpartition identities. We extend Sang, Shi, and Yee's work to arbitrary moduli, and also provide a missing case in their identities. We also unify proofs of Rogers-Ramanujan-Gordon identities for overpartitions due to Lovejoy and Chen et.al.; Sang, Shi, and Yee's results; and ours. Although verification type proofs are given for brevity, a construction of se…
In this paper, we combined two types of partitions and introduced 2-colored Rogers-Ramanujan partitions. By finding some functional equations and using a constructive method, some identities have been found. Some Overpartition identities coincide with our findings. A correspondence between colored partitions and overpartitions is provided.
In 1980, Bressoud conjectured a combinatorial identity $A_j=B_j$ for $j=0$ or $1$, where the function $A_j$ counts the number of partitions with certain congruence conditions and the function $B_j$ counts the number of partitions with certain difference conditions. Bressoud's conjecture specializes to a wide variety of well-known theorems in the theory of partitions. Special cases of his conjecture have been subsequently proved by Bressoud, Andrews, Kim and Yee. Recently, Kim resolved Bressoud's conjecture for the case $j=1$. In this paper, we introduce a new partition function $\bar{B}_j$ whi…
We obtain a three-parameter $q$-series identity that generalizes two results of Chan and Mao. By specializing our identity, we derive new results of combinatorial significance in connection with $N(r, s, m, n)$, a function counting certain overpartition pairs recently introduced by Bringmann, Lovejoy and Osburn. For example, one of our identities gives a closed-form evaluation of a double series in terms of Chebyshev polynomials of the second kind, thereby resulting in an analogue of Euler's pentagonal number theorem. Another of our results expresses a multi-sum involving $N(r, s, m, n)$ in te…
This paper is concerned with a class of partition functions $a(n)$ introduced by Radu and defined in terms of eta-quotients. By utilizing the transformation laws of Newman, Schoeneberg and Robins, and Radu's algorithms, we present an algorithm to find Ramanujan-type identities for $a(mn+t)$. While this algorithm is not guaranteed to succeed, it applies to many cases. For example, we deduce a witness identity for $p(11n+6)$ with integer coefficients. Our algorithm also leads to Ramanujan-type identities for the overpartition functions $\overline{p}(5n+2)$ and $\overline{p}(5n+3)$ and Andrews--P…
Using basic hypergeometric functions and partial fraction decomposition we give a new kind of generalization of identities due to Uchimura, Dilcher, Van Hamme, Prodinger, and Chen-Fu related to divisor functions. An identity relating Lambert series to Eulerian polynomials is also proved.
In this article we extend a theorem of Andrews, Crippa, and Simon on the asymptotic behavior of polynomials defined by a general class of recursive equations. Here the polynomials are in the variable $q$, and the recursive definition at step $n$ introduces a polynomial in $n$. Our extension replaces the polynomial in $n$ with either an exponential or periodic function of $n$.
In this article, a $q$-series examined by Kluyver and Uchimura is generalized. This allows us to find generalization of the identities in the random acyclic digraph studied by Simon, Crippa, and Collenberg in 1993. As one of the corollaries of our main theorem, we get results of Dilcher and Andrews, Crippa, and Simon. This main theorem involves a surprising new generalization of the divisor function $σ_s(n)$, which we denote by $σ_{s,z}(n)$. Analytic properties of $σ_{s,z}(n)$ are also studied. As a special case of one of our theorem we obtain result from a recent paper of Bringmann and Jennin…
In 1984, Bressoud and Subbarao obtained an interesting weighted partition identity for a generalized divisor function, by means of combinatorial arguments. Recently, the last three named authors found an analytic proof of the aforementioned identity of Bressoud and Subbarao starting from a $q$-series identity of Ramanujan. In the present paper, we revisit the combinatorial arguments of Bressoud and Subbarao, and derive a more general weighted partition identity. Furthermore, with the help of a fractional differential operator, we establish a few more Bressoud-Subbarao type weighted partition i…
George Andrews and Ae Ja Yee recently established beautiful results involving bivariate generalizations of the third order mock theta functions $ω(q)$ and $ν(q)$, thereby extending their earlier results with the second author. Generalizing the Andrews-Yee identities for trivariate generalizations of these mock theta functions remained a mystery, as pointed out by Li and Yang in their recent work. We partially solve this problem and generalize these identities. Several new as well as well-known results are derived. For example, one of our two main theorems gives, as a corollary, a special case …
Using a specific form of the triple product identity, polygonal number identities are stated. Further number identities are examined that can be considered identities related to modular sets of numbers. The identities can be used to give results on integer partitions with parts from numbers in modular arithmetic progression. This includes recursive formulas for the number of partitions using these modular parts. The triple product identity can derive further recursive formulas. Additionally, there is a recursive formula for the related sum of divisors function. The specific triple product iden…
Uchimura, in 1987, introduced a probability generating function for a random variable $X$ and using properties of this function he discovered an interesting $q$-series identity. He further showed that the $m$-th cumulant with respect to the random variable $X$ is nothing but the generating function for the generalized divisor function $σ_{m-1}(n)$. Simon, Crippa, and Collenberg, in 1993, explored the $G_{n,p}$-model of a random acyclic digraph and defined a random variable $γ_n^{*}(1)$. Quite interestingly, they found links between limit of its mean and the generating function for the divisor …
We study the $q$-bracket operator of Bloch and Okounkov when applied to $f(λ)=\sum_{λ_i \in λ}g(λ_i)$ and $f(λ)=\sum_{\substack{λ_i \in λλ_i \text{distinct} }}g(λ_i)$. We use these expansions to derive convolution identities for the functions $f$ and link both classes of $q$-brackets through divisor sums. As a result, we generalize Euler's classic convolution identity for the partition function and obtain an analogous identity for the totient function. As corollaries, we generalize Stanley's theorem as well as provide several new combinatorial results.