Related papers: Congruences for Andrews' spt-function modulo power…

Ramanujan proved three famous congruences for the partition function modulo 5, 7, and 11. The first author and Boylan proved that these congruences are the only ones of this type. In 1984 Andrews introduced the $m$-colored Frobenius…

The partition function is known to exhibit beautiful congruences that are often proved using the theory of modular forms. In this paper, we study the extent to which these congruence results apply to the generalized Frobenius partitions…

Let $p(n)$ be the ordinary partition function. In the 1960s Atkin found a number of examples of congruences of the form $p( Q^3 \ell n+\beta)\equiv0\pmod\ell$ where $\ell$ and $Q$ are prime and $5\leq \ell\leq 31$; these lie in two natural…

The partition function $ p_{[1^c11^d]}(n)$ can be defined using the generating function, \[\sum_{n=0}^{\infty}p_{[1^c{11}^d]}(n)q^n=\prod_{n=1}^{\infty}\dfrac{1}{(1-q^n)^c(1-q^{11 n})^d}.\] In this paper, we prove infinite families of…

For any positive integers $n$ and $r$, let $p_r(n)$ denotes the number of partitions of $n$ where each part has $r$ distinct colours. Many authors studied the partition function $p_r(n)$ for particular values of $r$. In this paper, we prove…

Recently Lachterman, Schayer, and Younger published an elegant proof of the Ramanujan congruences for the partition function $p(n)$. Their proof uses only the classical theory of modular forms as well as a beautiful result of Choie, Kohnen,…

We give congruences modulo powers of $p \in \{3, 5,7\}$ for the Fourier coefficients of certain modular functions in level $p$ with poles only at 0, answering a question posed by Andersen and the first author and continuing work done by the…

Andrews and Paule revisited combinatorial structures known as the $k$-elongated partition diamonds, which were introduced in connection with the study of the broken $k$-diamond partitions. They found the generating function for the number…

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…

Let $f(q)$ denote Ramanujan's mock theta function \[f(q) = \sum_{n=0}^{\infty} a(n) q^{n} := 1+\sum_{n=1}^{\infty} \frac{q^{n^{2}}}{(1+q)^{2}(1+q^{2})^{2}\cdots(1+q^{n})^{2}}.\] It is known that there are many linear congruences for the…

For a given prime $p$, we study the properties of the $p$-dissection identities of Ramanujan's theta functions $\psi(q)$ and $f(-q)$, respectively. Then as applications, we find many infinite family of congruences modulo 2 for some…

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…

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 2017, Andrews, Dixit, Schultz and Yee introduced the function $\overline{\textrm{spt}}_\omega(n)$, which denotes the number of smallest parts in the overpartitions of $n$ in which the smallest part is always overlined and all odd parts…

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…

The starting point for this work is the family of functions $\overline{p}_{-t}(n)$ which counts the number of $t$--colored overpartitions of $n.$ In recent years, several infinite families of congruences satisfied by $\overline{p}_{-t}(n)$…

In 1984, Andrews introduced the family of partition functions \(c\phi_k(n)\), which counts the number of generalized Frobenius partitions of \(n\) with \(k\) colors. In previous work, we proved a conjecture on congruences for \(c\phi_6(n)\)…

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…

Let $p(n)$ denote the partition function. In this article, we will show that congruences of the form $$ p(m^j\ell^kn+B)\equiv 0\mod m \text{for all} n\ge 0 $$ exist for all primes $m$ and $\ell$ satisfying $m\ge 13$ and $\ell\neq 2,3,m$.…

In a recent paper, Jin, Liu, and Xia \cite{JLX} presented some modulo 4 congruences for $\overline{spt2}(n)$, the number of smallest parts in the overpartitions of $n$ where the smallest part is even and is not overlined. In this paper, we…