相关论文: On the Parity of the Generalized Frobenius Partiti…
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 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 the 1960s Atkin discovered congruences modulo primes $\ell\leq 31$ for the partition function $p(n)$ in arithmetic progressions modulo $\ell Q^3$, where $Q\neq \ell$ is prime. Recent work of the first author with Allen and Tang shows…
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…
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…
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)\)…
For rational $\alpha$, the fractional partition functions $p_\alpha(n)$ are given by the coefficients of the generating function $(q;q)^\alpha_\infty$. When $\alpha=-1$, one obtains the usual partition function. Congruences of the form…
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 2012, Peter Paule and Cristian-Silviu Radu proved an infinite family of Ramanujan type congruences for $2$-colored Frobenius partitions $c\phi_2$ introduced by George Andrews. Recently, Frank Garvan, James Sellers and Nicolas Smoot…
Let $N\geq 1$ be squarefree with $(N,6)=1$. Let $c\phi_N(n)$ denote the number of $N$-colored generalized Frobenius partition of $n$ introduced by Andrews in 1984. We prove $$ c\phi_N(n)= \sum_{d \mid N} N/d \cdot P\left( \frac{ N}{d^2}n -…
Let $k$ and $n$ be positive integers. Let $c\phi_{k}(n)$ denote the number of $k$-colored generalized Frobenius partitions of $n$ and $\mathrm{C}\Phi_k(q)$ be the generating function of $c\phi_{k}(n)$. In this article, we study…
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…
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…
For primes $\ell$ and nonnegative integers $a$, we study the partition functions $$p_\ell(a;n):= \#\{\lambda \vdash n : \text{ord}_\ell(H(\lambda))=a\},$$ where $H(\lambda)$ denotes the product of hook lengths of a partition $\lambda$.…
The partition function $ p_{[1^c\ell^d]}(n)$ can be defined using the generating function, \[\sum_{n=0}^{\infty}p_{[1^c{\ell}^d]}(n)q^n=\prod_{n=1}^{\infty}\dfrac{1}{(1-q^n)^c(1-q^{\ell n})^d}.\] In \cite{P}, we proved infinite family of…
The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive study for the past century. Ramanujan proved that there are linear congruences of the form $p(\ell n+\beta)\equiv 0\pmod\ell$ for the…
Since their introduction by Andrews, generalized Frobenius partitions have interested a number of authors, many of whom have worked out explicit formulas for their generating functions in specific cases. This has uncovered interesting…
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…
Recently, Amdeberhan, Sellers, and Singh introduced the notion of a generalized cubic partition function $a_c(n)$ and proved two isolated congruences via modular forms, namely, $a_3(7n+4)\equiv 0\pmod{7}$ and $a_5(11n+10)\equiv 0\pmod{11}$.…
For any non-negative integer $n$ and non-zero integer $r$, let $p_r(n)$ denote Ramanujan's general partition function. By employing $q$-identities, we prove some new Ramanujan-type congruences modulo 5 for $p_r(n)$ for $r=-(5\lambda+1),…