Related papers: Ramanujan-type Congruences for Broken 2-Diamond Pa…

Let $p_{\{3, 3\}}(n)$ denote the number of $3$-regular partitions in three colours. In a very recent paper, da Silva and Sellers studied certain arithmetic properties of $p_{\{3, 3\}}(n)$. They further conjectured four Ramanujan-like…

Let $p_{-k}(n)$ enumerate the number of $k$-colored partitions of $n$. In this paper, we establish some infinite families of congruences modulo 25 for $k$-colored partitions. Furthermore, we prove some infinite families of Ramanujan-type…

We obtain an asymptotic formula for Andrews and Paule's broken $k$-diamond partition function $\Delta_k(n)$ where $k=1$ or $2$. Based on this asymptotic formula, we derive that $\Delta_k(n)$ satisfies the order $d$ Tur\'an inequalities for…

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$…

Ramanujan's celebrated partition congruences modulo $\ell\in \{5, 7, 11\}$ assert that $$ p(\ell n+\delta_{\ell})\equiv 0\pmod{\ell}, $$ where $0<\delta_{\ell}<\ell$ satisfies $24\delta_{\ell}\equiv 1\pmod{\ell}.$ By proving Subbarao's…

George Andrews and Peter Paule have recently conjectured an infinite family of congruences modulo powers of 3 for the 2-elongated plane partition function $d_2(n)$. This congruence family appears difficult to prove by classical methods. We…

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

Motivated by Andrews' partitions with initial repetitions, we derive parity formulas for several functions for this class of partitions. In many cases, we present an infinite family of Ramanujan-like congruences modulo 2.

The main result of the paper is the existence of an infinitely many families of Ramanujan-type congruences for $b_4(n)$ and $b_6(n)$ modulo primes $m \geq 2$ and $m \geq 5$, respectively. We provide new examples of congruences for $b_4(n)$…

Recently Amdeberhan, Sellers, and Singh introduced a new infinite family of partition functions called generalized cubic partitions. Given a positive integer $d$, they let $a_d(n)$ be the counting function for partitions of $n$ in which the…

Ramanujan (and others) proved that the partition function satisfies a number of striking congruences modulo powers of 5, 7 and 11. A number of further congruences were shown by the works of Atkin, O'Brien, and Newman. In this paper we prove…

In a recent work, Andrews defined the singular overpartitions with the goal of presenting an overpartition analogue to the theorems of Rogers--Ramanujan type for ordinary partitions with restricted successive ranks. As a small part of his…

In this work we introduce new combinatorial objects called $d$--fold partition diamonds, which generalize both the classical partition function and the partition diamonds of Andrews, Paule and Riese, and we set $r_d(n)$ to be their counting…

Let $p_{-t}(n)$ denote the number of partitions of $n$ into $t$ colors. In analogy with Ramanujan's work on the partition function, Lin recently proved in \cite{Lin} that $p_{-3}(11n+7)\equiv0\pmod{11}$ for every integer $n$. Such…

Let $\mathrm{pod}(n)$ denote the number of partitions of $n$ with odd parts distinct, and ${{r}_{k}}(n)$ be the number of representations of $n$ as sum of $k$ squares. We find the following two arithmetic relations: for any integer $n\ge…

Let $T_{\ell,k}(n)$ denote the number of $\ell$-regular $k$-tuple partitions of $n$. In a recent work, Nath, Saikia, and Sarma derived several families of congruences for $T_{\ell,k}(n)$, with particular emphasis on the cases $T_{2,3}(n)$…

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…

A partition of $n$ is called a $t$-core partition if none of its hook number is divisible by $t.$ In 2019, Hirschhorn and Sellers \cite{Hirs2019} obtained a parity result for $3$-core partition function $a_3(n)$. Motivated by this result,…

We prove several Ramanujan-type congruences modulo powers of $5$ for partition $k$-tuples with $5$-cores, for $k=2, 3, 4$. We also prove some new infinite families of congruences modulo powers of primes for $k$-tuples with $p$-cores, where…

In this paper, we consider the set of partitions $ped(n)$ which counts the number of partitions of $n$ wherein the even parts are distinct (and the odd parts are unrestricted). Using an algorithm developed by Radu, we prove congruences…