English
Related papers

Related papers: Untrodden pathways in the theory of the restricted…

200 papers

Let spt(n) denote the total number of appearances of smallest parts in the partitions of n. Recently, Andrews showed how spt(n) is related to the second rank moment, and proved some surprising Ramanujan-type congruences mod 5, 7 and 13. We…

Number Theory · Mathematics 2008-06-11 F. G. Garvan

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

Let $N(\leq m,n)$ denote the number of partitions of $n$ with rank not greater than $m$, and let $M(\leq m,n)$ denote the number of partitions of $n$ with crank not greater than $m$. Bringmann and Mahlburg observed that $N(\leq m,n)\leq…

Combinatorics · Mathematics 2017-04-05 William Y. C. Chen , Kathy Q. Ji , Wenston J. T. Zang

We consider the symmetrized moments of three ranks and cranks, similar to the work of Garvan for the rank and crank of a partition. By using Bailey pairs and elementary rearrangements, we are able to find useful expressions for these…

Number Theory · Mathematics 2014-12-12 Chris Jennings-Shaffer

Dyson's rank function and the Andrews--Garvan crank function famously give combinatorial witnesses for Ramanujan's partition function congruences modulo 5, 7, and 11. While these functions can be used to show that the corresponding sets of…

Number Theory · Mathematics 2022-03-23 Kathrin Bringmann , Kevin Gomez , Larry Rolen , Zack Tripp

In $1944$, Freeman Dyson defined the concept of rank of an integer partition and introduced without definition the term of crank of an integer partition. A definition for the crank satisfying the properties hypothesized for it by Dyson was…

Combinatorics · Mathematics 2020-06-16 Mircea Merca

The notion of the spt-crank of a vector partition, or an $S$-partition, was introduced by Andrews, Garvan and Liang. Let $N_S(m,n)$ denote the number of $S$-partitions of $n$ with spt-crank $m$. Andrews, Dyson and Rhoades conjectured that…

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

Moments of the partition rank and crank statistics have been studied for their connections to combinatorial objects such as Durfee symbols, as well as for their connections to harmonic Maass forms. This paper proves a conjecture due to…

Number Theory · Mathematics 2014-02-26 K. Bringmann , K. Mahlburg , R. Rhoades

Dyson famously provided combinatorial explanations for Ramanujan's partition congruences modulo $5$ and $7$ via his rank function, and postulated that an invariant explaining all of Ramanujan's congruences modulo $5$, $7$, and $11$ should…

Number Theory · Mathematics 2021-05-28 Larry Rolen , Zack Tripp , Ian Wagner

Andrews, Chan, and Kim recently introduced a modified definition of crank and rank moments for integer partitions that allows the study of both even and odd moments. In this paper, we prove the asymptotic behavior of these moments in all…

Number Theory · Mathematics 2012-05-11 Kathrin Bringmann , Karl Mahlburg

Andrews' spt-function can be written as the difference between the second symmetrized crank and rank moment functions. Using the machinery of Bailey pairs a combinatorial interpretation is given for the difference between higher order…

Number Theory · Mathematics 2010-11-02 F. G. 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

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 this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…

Combinatorics · Mathematics 2022-11-17 Sylvie Corteel , Sergi Elizalde , Carla Savage

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. In this survey, we summarize recent developments in the study of spt($n$),…

Combinatorics · Mathematics 2017-07-17 William Y. C. Chen

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

Using quasimodular forms with respect to $\Gamma_0(4)$ we find exact relations between the M2-rank for partitions without repeated odd parts and three residual cranks. From these identities we are able to deduce various congruences mod 3…

Number Theory · Mathematics 2014-08-22 Chris Jennings-Shaffer

A generalization of a beautiful $q$-series identity found in the unorganized portion of Ramanujan's second and third notebooks is obtained. As a consequence, we derive a new three-parameter identity which is a rich source of…

Combinatorics · Mathematics 2018-06-15 Atul Dixit , Bibekananda Maji

Recently, Andrews proved two conjectures on a partition statistic introduced by Beck. Very recently, Chern established some results on weighted rank and crank moments and proved many Andrews-Beck type congruences. Motivated by Andrews and…

Number Theory · Mathematics 2023-08-14 Yang Lin , Ernest X. W. Xia , Xuan Yu

In a recent pioneering work, Andrews and Newman defined an extended function $p_{A,a}(n)$ of their minimal excludant or "mex" of a partition function. By considering the special cases $p_{k,k}(n)$ and $p_{2k,k}(n)$, they unearthed…

Number Theory · Mathematics 2024-01-29 Aritram Dhar , Avi Mukhopadhyay , Rishabh Sarma
‹ Prev 1 2 3 10 Next ›