Related papers: Congruences modulo powers of 5 for the rank parity…
While examples of Ramanujan-type congruences are amply available via their relation to Hecke operators, it remains unclear which of them should be considered of combinatorial origin and which of them are mere artifacts of the connection…
Mahlburg (2005) brilliantly showed the importance of crank functions in partition congruences that were originally guessed by Dyson (1944). Ramanujan's partition functions are the centre of these works. Not only for the theory on cranks,…
Andrews recently introduced k-marked Durfee symbols, which are a generalization of partitions that are connected to moments of Dyson's rank statistic. He used these connections to find identities relating their generating functions as well…
In this paper we study $b_5(n)$, the $5$-regular partitions of $n$. Using the theory of modular forms, we prove several theorems on the divisibility and distribution properties of $b_5(n)$ modulo prime $m\geq5$. In particular, we prove that…
Motivated by a question of Lovejoy \cite{lovejoy}, we show that three-colored Frobenius partition function $\c3$ and related arithmetic fuction $\cc3$ vanish modulo some powers of 5 in certain arithmetic progressions.
Lin introduced the partition function $\text{PDO}_t(n)$, which counts the total number of tagged parts over all the partitions of $n$ with designated summands in which all parts are odd. For $k\geq0$, Lin conjectured congruences for…
We obtain two-variable Hecke-Rogers identities for three universal mock theta functions. This implies that many of Ramanujan's mock theta functions, including all the third order functions, have a Hecke-Rogers-type double sum…
Almost nothing is known about the parity of the partition function $p(n)$, which is conjectured to be random. Despite this expectation, Ono surprisingly proved the existence of infinitely many linear dependence congruence relations modulo 4…
The study of integer partitions and their congruences dates back to 1919 when Ramanujan discovered his famous congruences for the partition function, $p(n)$. Since then, many other kinds of partition functions have been discovered, as well…
Bruinier and Ono recently developed the theory of generalized Borcherds products, which uses coefficients of certain Maass forms as exponents in infinite product expansions of meromorphic modular forms. Using this, one can use classical…
Recently, Andrews, Dixit and Yee defined two partition functions $p_{\omega}(n)$ and $p_{\nu}(n)$ that are related with Ramanujan's mock theta functions $\omega(q)$ and $\nu(q)$, respectively. In this paper, we present two variable…
Let $p_{k,3}(n)$ enumerate the number of 2-color partition triples of $n$ where one of the colors appears only in parts that are multiples of $k$. In this paper, we prove several infinite families of congruences modulo powers of 3 for…
Ramanujan gave a recurrence relation for the partition function in terms of the sum of the divisor function $\sigma(n)$. In 1885, J.W. Glaisher considered seven divisor sums closely related to the sum of the divisors function. We develop a…
Many authors have investigated the congruence relations amongst the coefficients of power series expansions of modular forms $f$ in modular functions $t$. In a recent paper, R. Osburn and B. Sahu examine several power series expansions and…
Ramanujan studied the analytic properties of many $q$-hypergeometric series. Of those, mock theta functions have been particularly intriguing, and by work of Zwegers, we now know how these curious $q$-series fit into the theory of…
Let $M_0(n)$ (resp. $M_1(n)$) denote the number of partitions of $n$ with even (reps. odd) crank. Choi, Kang and Lovejoy established an asymptotic formula for $M_0(n)-M_1(n)$. By utilizing this formula with the explicit bound, we show that…
In a recent paper, Andrews, Dixit, and Yee introduced a new spt-type function $\operatorname{spt}_\omega(n)$, which is closely related to Ramanujan's third order mock theta function $\omega(q)$. Garvan and Jennings-Shaffer introduce a crank…
Based on work of Atkin and Swinnerton-Dyer on partition rank difference functions, and more recent work of Lovejoy and Osburn, Mao has proved several inequalities between partition ranks modulo $10$, and additional results modulo $6$ and…
Recently, using modular forms and Smoot's {\tt Mathematica} implementation of Radu's algorithm for proving partition congruences, Merca proved the following two congruences: For all $n\geq 0,$ \begin{align*} A(9n+5) & \equiv 0 \pmod{3}, \\…
New identities and congruences involving the ranks and cranks of partitions are proved. The proof depends on a new partial differential equation connecting their generating functions.