English
Related papers

Related papers: Congruences for Andrews' Smallest Parts Partition …

200 papers

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…

Number Theory · Mathematics 2021-01-05 Dandan Chen , Rong Chen , Frank Garvan

In a recent study of sign-balanced, labelled posets Stanley [13], introduced a new integral partition statistic srank(pi) = O(pi) - O(pi'), where O(pi) denotes the number of odd parts of the partition pi and pi' the conjugate of pi. In [1]…

Combinatorics · Mathematics 2007-05-23 Alexander Berkovich , Frank G. Garvan

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…

Number Theory · Mathematics 2022-12-06 Scott Ahlgren , Olivia Beckwith , Martin Raum

The spt-function $spt(n)$ was introduced by Andrews as the weighted counting of partitions of $n$ with respect to the number of occurrences of the smallest part. Andrews, Garvan and Liang defined the spt-crank of an $S$-partition which…

Combinatorics · Mathematics 2013-08-15 William Y. C. Chen , Kathy Q. Ji , Wenston J. T. Zang

In a previous paper arXiv:2406.06294 [math.NT], the author proved the exact formulae for ranks of partitions modulo each prime $p\geq 5$. In this paper, for $p=5$ and $7$, we prove special vanishing properties of the Kloosterman sums…

Number Theory · Mathematics 2025-03-13 Qihang Sun

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…

Number Theory · Mathematics 2019-07-17 Erin Bevilacqua , Kapil Chandran , Yunseo Choi

By introducing $k$-marked Durfee symbols, Andrews found a combinatorial interpretation of $2k$-th symmetrized moment $\eta_{2k}(n)$ of ranks of partitions of $n$. Recently, Garvan introduced the $2k$-th symmetrized moment $\mu_{2k}(n)$ of…

Combinatorics · Mathematics 2013-12-10 William Y. C. Chen , Kathy Q. Ji , Erin Y. Y. Shen

Denote by $p(n)$ the number of partitions of $n$ and by $N(a,M;n)$ the number of partitions of $n$ with rank congruent to $a$ modulo $M$. We find and prove a general formula for Dyson's ranks by considering the deviation of the ranks from…

Number Theory · Mathematics 2017-02-09 Dean Hickerson , Eric Mortenson

We utilize Dyson's concept of the adjoint of a partition to derive an infinite family of new polynomial analogues of Euler's Pentagonal Number Theorem. We streamline Dyson's bijection relating partitions with crank <= k and those with k in…

Combinatorics · Mathematics 2007-05-23 Alexander Berkovich , Frank G. Garvan

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…

Number Theory · Mathematics 2024-07-11 Dandan Chen , Rong Chen , Frank Garvan

Denote by $p(n)$ the number of partitions of $n$ and by $N(a,M;n)$ the number of partitions of $n$ with rank congruent to $a$ modulo $M$. By considering the deviation \begin{equation*} D(a,M) := \sum_{n= 0}^{\infty}\left(N(a,M;n) -…

Number Theory · Mathematics 2018-08-01 Eric T. Mortenson

Motivated by Andrews' partitions with initial repetitions, we derive parity formulas for several functions for this class of partitions. In many cases, we present an infinite family of Ramanujan-like congruences modulo 2.

Number Theory · Mathematics 2023-06-13 Darlison Nyirenda , Beaullah Mugwangwavari

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…

Number Theory · Mathematics 2023-03-10 Nankun Hong , Renrong Mao

We generalize a result of Garvan on inequalities and interpretations of the moments of the partition rank and crank functions. In particular for nearly 30 Bailey pairs, we introduce a rank-like function, establish inequalities with the…

Number Theory · Mathematics 2016-10-13 Catherine Babecki , Chris Jennings-Shaffer , Geoffrey Sangston

The inequality between rank and crank moments was conjectured and later proved by Garvan himself in 2011. Recently, Dixit and the authors introduced finite analogues of rank and crank moments for vector partitions while deriving a finite…

Number Theory · Mathematics 2020-11-17 Pramod Eyyunni , Bibekananda Maji , Garima Sood

Bringmann and Lovejoy introduced a rank for overpartition pairs and investigated its role in congruence properties of $\bar{pp}(n)$, the number of overpartition pairs of n. In particular, they applied the theory of Klein forms to show that…

Combinatorics · Mathematics 2010-09-28 William Y. C. Chen , Bernard L. S. Lin

We study two types of crank moments and two types of rank moments for overpartitions. We show that the crank moments and their derivatives, along with certain linear combinations of the rank moments and their derivatives, can be written in…

Number Theory · Mathematics 2021-02-03 Kathrin Bringmann , Jeremy Lovejoy , Robert Osburn

Let $p_r(n)$ denote the number of $r$-component multipartitions of $n$, and let $S_{\gamma,\lambda}$ be the space spanned by $\eta(24z)^\gamma \phi(24z)$, where $\eta(z)$ is the Dedekind's eta function and $\phi(z)$ is a holomorphic modular…

Combinatorics · Mathematics 2012-06-29 William Y. C. Chen , Daniel K. Du , Qing-Hu Hou , Lisa H. Sun

Let $N_k(m,n)$ denote the number of partitions of $n$ with Garvan $k$-rank $m$. It is well-known that Andrews-Garvan-Dyson's crank and Dyson's rank are the $k$-rank for $k=1$ and $k=2$, respectively. In this paper, we prove that the…

Number Theory · Mathematics 2022-06-02 Nian Hong Zhou

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…

Number Theory · Mathematics 2022-06-22 Madeline Locus , Ian Wagner