相关论文: Congruence families modulo powers of $7$ for $4$-c…

In 2024, Garvan, Sellers and Smoot discovered a remarkable symmetry in the families of congruences for generalized Frobenius partitions $c\psi_{2,0}$ and $c\psi_{2,1}$. They also emphasized that the considerations for the general case of…

In $1984$, Andrews introduced the family of partition functions $c\phi_k(n)$, which enumerate generalized Frobenius partitions of $n$ with $k$ colors. In $2016$, Gu, Wang, and Xia established several congruences for $c\phi_6(n)$ and…

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 2012 Paule and Radu proved a difficult family of congruences modulo powers of 5 for Andrews' 2-colored generalized Frobenius partition function. The family is associated with the classical modular curve of level 20. We demonstrate the…

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)\)…

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…

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…

Let $c\phi_{k}(n)$ be the number of $k$-colored generalized Frobenius partitions of $n$. We establish some infinite families of congruences for $c\phi_{3}(n)$ and $c\phi_{9}(n)$ modulo arbitrary powers of 3, which refine the results of…

Recently, using modular forms and Smoot's {\tt Mathematica} implementation of Radu's algorithm for proving partition congruences, Merca proved the following two congruences: For all $n\geq 0,$ \begin{align*} A(9n+5) & \equiv 0 \pmod{3}, \\…

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…

For an integer $c\geq 1$, let $a_c(n)$ count the number of generalized cubic partitions of $n$, which are partitions of $n$ whose even parts may appear in $c$ different colors, and $d_c(n)$ count the number of partitions obtained by adding…

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…

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 {\it partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…

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…

The notion of broken $k$-diamond partitions was introduced by Andrews and Paule. Let $\Delta_k(n)$ denote the number of broken k-diamond partitions of $n$. They also posed three conjectures on the congruences of $\Delta_2(n)$ modulo 2, 5…

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

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_{k,3}(n)$ enumerate the number of 2-color partition triples of $n$ where one of the colors appears only in parts that are multiples of $k$. In this paper, we prove several infinite families of congruences modulo powers of 3 for…

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…