相关论文: Congruences modulo powers of $5$ for odd ranks

Let $N^{0}(m,n)$ be the number of odd Durfee symbols of $n$ with odd rank $m$, and $N^{0}(a,M;n)$ be the number of odd Durfee symbols of $n$ with odd rank congruent to $a$ modulo $M$. We give explicit formulas for the generating functions…

Let $NT(m, k, n)$ denote the total number of parts in the partitions of n with rank congruent to m modulo k. Andrews proved Beck's conjecture on congruences for $NT(m, k, n)$ modulo 5 and 7. Generalizing Andrews'results, Chern obtain…

We define two-parameter generalizations of Andrews' $(k+1)$-marked odd Durfee symbols and $2k$th symmetrized odd rank moments, and study the automorphic properties of some of their generating functions. When $k=0$ we obtain families of…

The enumeration $d_k(n)$ of $k$-elongated plane partition diamonds has emerged as a generalization of the classical integer partition function $p(n)$. Congruences for $d_k(n)$ modulo certain powers of primes have been proven via elementary…

The distribution of values of the full ranks of marked Durfee symbols is examined in prime and nonprime arithmetic progressions. The relative populations of different residues for the same modulus are determined: the primary result is that…

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…

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…

Recently, Drema and Saikia (2023) proved several congruences modulo powers of 2 and 3 for overpartition triples with odd parts. We extend their list substantially. We prove several congruences modulo powers of 2 for overpartition k-tuples…

We prove three variations of recent results due to Andrews on congruences for $NT(m,k,n)$, the total number of parts in the partitions of $n$ with rank congruent to $m$ modulo $k$. We also conjecture new congruences and relations 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…

Andrews recently introduced k-marked Durfee symbols which are connected to moments of Dyson's rank. By these connections, Andrews deduced their generating functions and some combinatorial properties and left their purely combinatorial…

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…

Recently, Andrews and Paule introduced a partition function $PDN1(N)$ which denotes the number of partition diamonds with $(n+1)$ copies of $n$ where summing the parts at the links gives $N$. They also presented the generating function for…

Recently, Drema and N. Saikia (2023) and M. P. Saikia, Sarma, and Sellers (2023) proved several congruences modulo powers of $2$ for overpartition triples with odd parts. In this paper, we study further divisibility properties of…

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…

Congruences are found modulo powers of 5, 7 and 13 for Andrews' smallest parts partition function spt(n). These congruences are reminiscent of Ramanujan's partition congruences modulo powers of 5, 7 and 11. Recently, Ono proved explicit…

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…

Let $\mathrm{pod}(n)$ denote the number of partitions of $n$ with odd parts distinct, and ${{r}_{k}}(n)$ be the number of representations of $n$ as sum of $k$ squares. We find the following two arithmetic relations: for any integer $n\ge…

In this article we exhibit new explicit families of congruences for the overpartition function, making effective the existence results given previously by Treneer. We give infinite families of congruences modulo $m$ for $m = 5, 7, 11$, and…

Recently, Amdeberhan and Merca proved some arithmetic properties of the crank parity function $C(n)$ defined as the difference between the number of partitions of $n$ with even cranks and those with odd cranks and the sequence $a(n)$ whose…