Related papers: Asymptotic formulae for partition ranks

In a recent paper, Bacher and de la Harpe study the conjugacy growth series of finitary permutation groups. In the course of studying the coefficients of a series related to the finitary alternating group, they introduce generalized…

We derive an asymptotic formula for $A(n,j,r)$ the number of integer partitions of $n$ into at most $j$ parts each part $\le r$. We assume $j$ and $r$ are near their mean values. We also investigate the second largest part, the number of…

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…

We give combinatorial interpretations of two residual cranks of overpartitions defined by Bringmann, Lovejoy and Osburn in 2009 analogous to the crank of partitions given by Andrews and the first author in 1988. As a consequence, we give…

We give an overview of basic methods that can be used for obtaining asymptotic expansions of integrals: Watson's lemma, Laplace's method, the saddle point method, and the method of stationary phase. Certain developments in the field of…

We consider a bivariate rational generating function F(x,y) = P(x,y) / Q(x,y) = sum_{r, s} a_{r,s} x^r y^s under the assumption that the complex algebraic curve $\sing$ on which $Q$ vanishes is smooth. Formulae for the asymptotics of the…

In 1917, Hardy and Ramanujan obtained the asymptotic formula for the classical partition function $p(n)$. The classical partition function $p(n)$ has been extensively studied. Recently, Luca and Ralaivaosaona obtained the asymptotic formula…

In 1962 Dyson used a physically based, macroscopic argument to deduce the first two terms of the large spacing asymptotic expansion of the gap probability for the bulk state of random matrix ensembles with symmetry parameter \beta. In the…

Many natural and social systems possess power-law memory, and their mathematical modeling requires the application of discrete and continuous fractional calculus. Most of these systems are nonlinear and demonstrate regular and chaotic…

Among all sequences that satisfy a divide-and-conquer recurrence, the sequences that are rational with respect to a numeration system are certainly the most immediate and most essential. Nevertheless, until recently they have not been…

We give asymptotic analysis of power series associated with lacunary partition functions. New partition theoretic interpretations of some basic hypergeometric series are offered as examples.

We establish formulas for the constant factor in several asymptotic estimates related to the distribution of integer and polynomial divisors. The formulas are then used to approximate these factors numerically.

An asymptotic expansion of a ratio of products of gamma functions is derived. It generalizes a formula which was stated by Dingle, first proved by Paris, and recently reconsidered by Olver.

In 1918, Hardy and Ramanujan published a seminal paper which included an asymptotic formula for the partition function. In their paper, they also claim without proof an asymptotic equivalence for $p^k(n)$, the number of partitions of a…

Let $F_n(x)$ be the partition polynomial $\sum_{k=1}^n p_k(n) x^k$ where $p_k(n)$ is the number of partitions of $n$ with $k$ parts. We emphasize the computational experiments using degrees up to $70,000$ to discover the asymptotics of…

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…

We give an alternative method to that of Hardy-Ramanujan-Rademacher to derive the leading exponential term in the asymptotic approximation to the partition function p(n,a), defined as the number of decompositions of a positive integer 'n'…

Asymptotic study on the partition function $p(n)$ began with the work of Hardy and Ramanujan. Later Rademacher obtained a convergent series for $p(n)$ and an error bound was given by Lehmer. Despite having this, a full asymptotic expansion…

In this article we define and study a notion of asymptotic rank for metric spaces and show in our main theorem that for a large class of spaces, the asymptotic rank is characterized by the growth of the higher filling functions. For a…

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…