English
Related papers

Related papers: Rank partition functions and truncated theta ident…

200 papers

Bringmann, Mahlburg, and Rhoades have found asymptotic expressions for all moments of the partition statistics rank and crank. In this work we extend their methods to higher ranks. The $T$-rank, introduced by Garvan, for odd integers T=3 is…

Number Theory · Mathematics 2012-05-15 Matthias Waldherr

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

In this paper we prove a longstanding conjecture by Freeman Dyson concerning the limiting shape of the crank generating function. We fit this function in a more general family of inverse theta functions which play a key role in physics.

Number Theory · Mathematics 2014-06-24 Kathrin Bringmann , Jehanne Dousse

In this paper, we establish that the number of partitions of a natural number with positive odd rank is equal to the number of two-color partitions (red and blue), where the smallest part is even (say $2n$) and all red parts are even and…

Combinatorics · Mathematics 2025-01-14 George E. Andrews , Rahul Kumar

Let $k$ be a positive integer and $m$ be an integer. Garvan's $k$-rank $N_k(m,n)$ is the number of partitions of $n$ into at least $(k-1)$ successive Durfee squares with $k$-rank equal to $m$. In this paper give some asymptotics for…

Number Theory · Mathematics 2019-10-03 Nian Hong Zhou

In 1954, Atkin and Swinnerton-Dyer proved Dyson's conjectures on the rank of a partition by establishing formulas for the generating functions for rank differences in arithmetic progressions. In this paper, we prove formulas for the…

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

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 modulo…

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

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

In a series of papers the first author and Ono connected the rank, a partition statistic introduced by Dyson, to weak Maass forms, a new class of functions which are related to modular forms. Naturally it is of wide interest to find other…

Number Theory · Mathematics 2007-08-07 Kathrin Bringmann , Jeremy Lovejoy

This is the third and final installment in our series of papers applying the method of Atkin and Swinnerton-Dyer to deduce formulas for rank differences. The study of rank differences was initiated by Atkin and Swinnerton-Dyer in their…

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

In this paper, we investigate the arithmetic properties of the difference between the number of partitions of a positive integer $n$ with even crank and those with odd crank, denoted $C(n)=c_e(n)-c_o(n)$. Inspired by Ramanujan's classical…

Number Theory · Mathematics 2025-05-27 Tewodros Amdeberhan , Mircea Merca

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

At the 1987 Ramanujan Centenary meeting Dyson asked for a coherent group-theoretical structure for Ramanujan's mock theta functions analogous to Hecke's theory of modular forms. Many of Ramanujan's mock theta functions can be written in…

Number Theory · Mathematics 2016-09-09 Frank Garvan

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

Recently, much attention has been given to various inequalities among partition functions. For example, Nicolas, {and later DeSavlvo--Pak,} proved that $p(n)$ is eventually log-concave, and Ji--Zang showed that the cranks are eventually…

Number Theory · Mathematics 2022-09-27 Kathrin Bringmann , Siu Hang Man , Larry Rolen

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

In this paper we refine a weighted partition identity of Alladi. We write explicit formulas of generating functions for the number of partitions grouped with respect to a partition statistic other than the norm. We tie our weighted results…

Combinatorics · Mathematics 2016-04-01 Ali Kemal Uncu

The Dyson rank of an integer partition is the difference between its largest part and the number of parts it contains. Using Fine-Dyson symmetry, we give formulas for the number of partitions of n with rank larger than n/2, and we prove…

Number Theory · Mathematics 2023-03-20 Colin Alberts , Olivia Beckwith , Irfan Demetoglu , Robert Dicks , John H. Smith , Jasmine Wang

Bringmann, Lovejoy, and Osburn showed that the generating functions of the spt-overpartition functions spt(n), spt1(n), spt2(n), and M2spt(n) are quasimock theta functions, and satisfy a number of simple Ramanujan-like congruences. Andrews,…

Number Theory · Mathematics 2014-12-12 Frank Garvan , Chris Jennings-Shaffer