English
Related papers

Related papers: Asymptotic inequalities for positive crank and ran…

200 papers

In this paper we obtain asymptotic formulas for the positive crank and rank moments for overpartitions. Moreover, we show that crank and rank moments are asymptotically equal while the difference is asymptotically positive. This indicates…

Number Theory · Mathematics 2014-03-27 Jose Miguel Zapata Rolon

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

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

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

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

We study combinatorial and asymptotic properties of the rank of strongly unimodal sequences. We find a generating function for the rank enumeration function, and give a new combinatorial interpretation of the ospt-function introduced by…

Number Theory · Mathematics 2018-11-26 Kathrin Bringmann , Chris Jennings-Shaffer , Karl Mahlburg , Robert Rhoades

In 2003, Atkin and Garvan initiated the study of rank and crank moments for ordinary partitions. These moments satisfy a strict inequality. We prove that a strict inequality also holds for the first rank and crank moments of overpartitions…

Number Theory · Mathematics 2021-02-04 George Andrews , Song Heng Chan , Byungchan Kim , Robert Osburn

Two analogues of the crank function are defined for overpartitions -- the first residual crank and the second residual crank. This suggests an exploration of crank functions defined for overpartitions whose parts are divisible by an…

Number Theory · Mathematics 2019-12-13 Ali H. Al-Saedi , Thomas Morrill , Holly Swisher

In this paper, we obtain asymptotic formulas for an infinite class of rank generating functions. As an application, we solve a conjecture of Andrews and Lewis on inequalities between certain ranks.

Number Theory · Mathematics 2007-08-07 Kathrin Bringmann

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

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

We obtain a finite analogue of a recent generalization of an identity in Ramanujan's Notebooks. Differentiating it with respect to one of the parameters leads to a result whose limiting case gives a finite analogue of Andrews' famous…

Number Theory · Mathematics 2018-12-05 Atul Dixit , 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 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

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

Integer partitions have fascinated people for centuries, from Ramanujan's groundbreaking congruences to the modern theory of modular forms. This paper investigates the statistical properties of odd unimodal sequences--a natural refinement…

Number Theory · Mathematics 2026-05-11 Bing He , Guanting Liu

In this paper we compute asymptotics for the coefficients of an infinite class of overpartition rank generating functions. Using these results, we show that $ \overline{N}(a,c,n), $ the number of overpartitions of $ n $ with rank congruent…

Number Theory · Mathematics 2019-10-01 Alexandru Ciolan

We give asymptotic expansions for the moments of the $M_2$-rank generating function and for the $M_2$-rank generating function at roots of unity. For this we apply the Hardy-Ramanujan circle method extended to mock modular forms. Our…

Number Theory · Mathematics 2019-02-25 Chris Jennings-Shaffer , Dillon Reihill

We study the asymptotic behavior of the rank statistic for unimodal sequences. We use analytic techniques involving asymptotic expansions in order to prove asymptotic formulas for the moments of the rank. Furthermore, when appropriately…

Number Theory · Mathematics 2019-10-25 Kathrin Bringmann , Chris Jennings-Shaffer , Karl Mahlburg

We introduce a class of stochastic processes with reinforcement consisting of a sequence of random partitions $\{\mathcal{P}_t\}_{t \ge 1}$, where $\mathcal{P}_t$ is a partition of $\{1,2,\dots, Rt\}$. At each time~$t$,~$R$ numbers are…

Probability · Mathematics 2021-03-02 Caio Alves , Rodrigo Ribeiro , Daniel Valesin
‹ Prev 1 2 3 10 Next ›