Related papers: Finding Modular Functions for Ramanujan-Type Ident…

We present an infinite family of identities that represent Ramanujan's tau function in terms of convolution sums of twisted divisor functions. Our method involves explicitly constructing non-vanishing level $1$ cusp forms from modular forms…

Recently, Nadji, Ahmia and Ram\'{i}rez \cite{Nadji2025} investigate the arithmetic properties of ${\bar B}_{\ell_1,\ell_2}(n)$, the number of overpartitions where no part is divisible by $\ell_1$ or $\ell_2$ with $\gcd(\ell_1,\ell_2)$$=1$…

The famous Rogers-Ramanujan and Andrews--Gordon identities are embedded in a doubly-infinite family of Rogers-Ramanujan-type identities labelled by positive integers m and n. For fixed m and n the product side corresponds to a specialised…

A partition statistic ` crank' gives combinatorial interpretations for Ramanujan's famous partition congruences. In this paper, we establish an asymptotic formula, Ramanujan type congruences, and q-series identities that the number of…

Dyson famously provided combinatorial explanations for Ramanujan's partition congruences modulo $5$ and $7$ via his rank function, and postulated that an invariant explaining all of Ramanujan's congruences modulo $5$, $7$, and $11$ should…

Atkin and Garvan introduced the functions $N_k(n)$ and $M_k(n)$, which denote the $k$-th moments of ranks and cranks in the theory of partitions. Let $e_{2r}(n)$ be the $n$-th Fourier coefficient of $E_{2r}(\tau)/\eta(\tau)$, where…

One of the celebrated formulas of Ramanujan is about odd zeta values, which has been studied by many mathematicians over the years. A notable extension was given by Grosswald in 1972. Following Ramanujan's idea, we rediscovered a…

In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called {\it partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…

In a recent paper, Andrews and Newman introduced certain families of partition functions using the minimal excludant or "mex" function. In this article, we study two of the families of functions Andrews and Newman introduced, namely…

We describe how the Hardy-Ramanujan-Rademacher formula can be implemented to allow the partition function $p(n)$ to be computed with softly optimal complexity $O(n^{1/2+o(1)})$ and very little overhead. A new implementation based on these…

We study the generating functions for cylindric partitions with profile $(c_1,c_2,c_3)$ for all $c_1,c_2,c_3$ such that $c_1+c_2+c_3=5$. This allows us to discover and prove seven new $A_2$ Rogers-Ramanujan identities modulo $8$ with…

Inspired by Andrews' and Newman's work on the minimal excludant or "mex" of partitions, we define four new classes of minimal excludants for overpartitions and establish relations to certain functions due to Ramanujan.

In his famous 2007 paper on three dimensional quantum gravity, Witten defined candidates for the partition functions $$Z_k(q)=\sum_{n=-k}^{\infty}w_k(n)q^n$$ of potential extremal CFTs with central charges of the form $c=24k$. Although such…

In a very recent work, G. E. Andrews defined the combinatorial objects which he called {\it singular overpartitions} with the goal of presenting a general theorem for overpartitions which is analogous to theorems of Rogers--Ramanujan type…

We considerably improve Ono's and Ahlgren-Ono's work on the frequent occurrence of Ramanujan-type congruences for the partition function, and demonstrate that Ramanujan-type congruences occur in families that are governed by square-classes.…

We report on findings of a variant of ${\texttt{IdentityFinder}}$ - a Maple program that was used by two of the authors to conjecture several new identities of Rogers-Ramanujan kind. In the present search, we modify the parametrization of…

In this article, we study the arithmetic properties of the partition function $p_8(n)$, the number of 8-colour partitions of $n$. We prove several Ramanujan type congruences modulo higher powers of 2 for the function $p_8(n)$ by finding…

In this paper, we investigate the arithmetic properties of the difference between the number of partitions of a positive integer $n$ with even crank and those with odd crank, denoted $C(n)=c_e(n)-c_o(n)$. Inspired by Ramanujan's classical…

Partitions wherein the even parts appear in two different colours are known as cubic partitions. Recently, Merca introduced and studied the function $A(n)$, which is defined as the difference between the number of cubic partitions of $n$…

Let $p_r(n)$ denote the number of $r$-component multipartitions of $n$, and let $S_{\gamma,\lambda}$ be the space spanned by $\eta(24z)^\gamma \phi(24z)$, where $\eta(z)$ is the Dedekind's eta function and $\phi(z)$ is a holomorphic modular…