Related papers: Congruences for powers of the partition function

The celebrated Rogers-Ramanujan identities equate the number of integer partitions of $n$ ($n\in\mathbb N_0$) with parts congruent to $\pm 1 \pmod{5}$ (respectively $\pm 2 \pmod{5}$) and the number of partitions of $n$ with super-distinct…

Recent work of Garvan, Sellers, Smoot, and others has made connections between infinite families of congruences for various partition functions. Here, we apply this approach to families of congruences for PED and POD partitions and find…

For a positive integer $t\geq 2$, let $b_{t}(n)$ denote the number of $t$-regular partitions of a nonnegative integer $n$. In a recent paper, Keith and Zanello investigated the parity of $b_{t}(n)$ when $t\leq 28$. They discovered new…

In this paper, we consider the set of partitions $pend(n)$ which enumerates the number of partitions of $n$ wherein the even parts are not allowed to be distinct. Using a result of Newman, we prove a few infinite families of congruences…

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

Let $c_N(n)$ denotes the number of bipartitions $(\lambda, \mu)$ of a positive integer $n$ subject to the restriction that each part of $\mu$ is divisible by $N$. In this paper, we prove some congruence properties of the function $c_N(n)$…

We denote the number of partitions of $n$ wherein the even parts are distinct (and the odd parts are unrestricted) by $ped(n)$. In this paper, we will use generating function manipulations to obtain new congruences for $ped(n)$ modulo $24$.

For a sequence $M=(m_{i})_{i=0}^{\infty}$ of integers such that $m_{0}=1$, $m_{i}\geq 2$ for $i\geq 1$, let $p_{M}(n)$ denote the number of partitions of $n$ into parts of the form $m_{0}m_{1}\cdots m_{r}$. In this paper we show that for…

It is well known that Ramanujan conjectured congruences modulo powers of 5, 7 and and 11 for the partition function. These were subsequently proved by Watson (1938) and Atkin (1967). In 2009 Choi, Kang, and Lovejoy proved congruences modulo…

Let $pod_{\ell}(n)$ be the number of $\ell$-regular partitions of $n$ with distinct odd parts. In this article, prove that for any positive integer $k$, the set of non-negative integers $n$ for which $pod_{\ell}(n)\equiv 0 \pmod{p^{k}}$ has…

Inspired by Andrews' 2-colored generalized Frobenius partitions, we consider certain weighted 7-colored partition functions and establish some interesting Ramanujan-type identities and congruences. Moreover, we provide combinatorial…

Recently, Nayaka and Naika (2022) proved several congruences modulo $16$ and $32$ for $t$-colored overpartitions with $t=5,7,11$ and $13$. We extend their list using an algorithmic technique.

In this paper, we use a branch of polyhedral geometry, Ehrhart theory, to expand our combinatorial understanding of congruences for partition functions. Ehrhart theory allows us to give a new decomposition of partitions, which in turn…

A conjecture by Sun states that the partition function $p(n)$, for $n>1$, is never a perfect power. Recent work by Merca et al. proposes generalizations of perfect-power repulsion for $p(n)$. In this note, we prove these generalizations for…

The following congruence for power sums, $S_n(p)$, is well known and has many applications: $1^n+2^n +\dots +p^n \equiv\begin{cases} -1 \text{ mod } p, & \text{ if } \ p-1 \ | \ n; 0 \text{ mod } p, & \text{ if } \ p-1 \ \not| \ n,…

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…

Numerous congruences for partitions with designated summands have been proven since first being introduced and studied by Andrews, Lewis, and Lovejoy. This paper explicitly characterizes the number of partitions with designated summands…

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…

We prove explicit congruences modulo powers of arbitrary primes for three smallest parts functions: one for partitions, one for overpartitions, and one for partitions without repeated odd parts. The proofs depend on $\ell$-adic properties…

Recently, Andrews, Hirschhorn and Sellers have proven congruences modulo 3 for four types of partitions using elementary series manipulations. In this paper, we generalize their congruences using arithmetic properties of certain quadratic…