Related papers: Arithmetic Properties of Andrews' Singular Overpar…
In this paper, we generalize Andrews' partitions separated by parity to overpartitions in two ways. We investigate the generating functions for 16 overpartition families whose parts are separated by parity, and we prove various $q$-series…
Andrews investigated parity conditions in the Rogers-Ramanujan-Gordon theorem. Under the conditions that even parts or odd parts appear an even number of times, Andrews discovered two Rogers-Ramanujan-Gordon type partition theorems and…
We present a dual of a family of partition identities of Andrews involving partitions with no repeated odd parts (among other conditions), along with an overpartition generalization that encapsulates both families. These were discovered…
The $(k,i)$-singular overpartitions, combinatorial objects introduced by Andrews in 2015, are known to satisfy Ramanujan-type congruences modulo any power of prime coprime to $6k$. In this paper we consider the parity of the number…
Recently there has been quite a bit of study carried out related to arithmetic properties of overpartitions into non-multiples of two co-prime integers. The paper [19] by Nadji et al. looked into congruences modulo $3$ and powers of $2$ for…
We prove multiplicative congruences mod $2^{12}$ for George Andrews's partition function, $\overline{\mathcal{EO}}(n)$, the number of partitions of $n$ in which every even part is less than each odd part and only the largest even part…
In 2015 Choi, Kim, and Lovejoy studied a weighted partition function, $A_1(m)$, which counted subpartitions with a structure related to the Rogers--Ramanujan identities. They conjectured the existence of an infinite class of congruences for…
In his recent work, Andrews revisited two-color partitions with certain restrictions on the differences between consecutive parts, and he established three theorems linking these two-color partitions with more familiar kinds of partitions.…
We investigate Ramanujan congruences for the function which counts the overpartitions of n with restricted odd differences. In particular, we show that only one such congruence exists. Our method involves using the theory of modular forms…
In this short note, we prove several new congruences for the overcubic partition triples function, using both elementary techniques and the theory of modular forms. These extend the recent list of such congruences given by Nayaka,…
Recently, Andrews and Dastidar introduced the partition function $SOME(n)$, defined as the sum of all the odd parts in the partitions of $n$ minus the sum of all the even parts in the partitions of $n$. They derived its generating function…
In his 1984 AMS Memoir, George Andrews defined the family of $k$--colored generalized Frobenius partition functions. These are denoted by $c\phi_k(n)$ where $k\geq 1$ is the number of colors in question. In that Memoir, Andrews proved…
In 2022, Broudy and Lovejoy extensively studied the function $S(n)$ which counts the number of overpartitions of \emph{Schur-type}. In particular, they proved a number of congruences satisfied by $S(n)$ modulo $2$, $4$, and $5$. In this…
Recently, Andrews and EI Bachraoui discovered several companions for some famous $q$-series formulas, and derived some new identities involving partitions and overpartitions with distinct parts. In this paper, we shall refine their results…
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$…
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…
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…
We propose a method to construct a variety of partition identities at once. The main application is an all-moduli generalization of some of Andrews' results in [5]. The novelty is that the method constructs solutions to functional equations…
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…
Amdeberhan et al. (2024) introduced the notion of a generalized overcubic partition function $\overline a_c (n)$ and proved an infinite family of congruences modulo a prime $p\ge 3$ and some Ramanujan type congruences. In this paper, we…