Related papers: Asymptotic formulae for partition ranks

An asymptotic formula for the number of partitions into p-cores is derived. As a byproduct some integer valued trigonometric sums are found

In this paper, we use basic asymptotic analysis to establish some uniform asymptotic formulas for the Fourier coefficients of the inverse of Jacobi theta functions. In particular, we answer and improve some problems suggested and…

Inspired by a remarkable work of F\'{e}lix, Halperin and Thomas on the asymptotic estimation of the ranks of rational homotopy groups, and more recent works of Wu and the authors on local hyperbolicity, we prove two asymptotic formulae for…

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…

For a subset $\mathcal A\subset \mathbb N$, let $p_{\mathcal A}(n)$ denote the restricted partition function which counts partitions of $n$ with all parts lying in $\mathcal A$. In this paper, we use a variation of the Hardy-Littlewood…

We will prove an infinite family of asymptotic formulas for the logarithm of certain two-colored partitions. An infinite sub-family of these asymptotics was posed as a conjecture by Guadalupe.

We calculate full asymptotic expansions of prime-independent multiplicative functions on additive arithmetic semigroups that satisfy a strong form of Knopfmacher's axioms. When applied to the semigroup of unlabeled graphs, our method yields…

We study the distribution of partition parts in arithmetic progressions and find asymptotic results that capture all exponentially growing terms. This is accomplished by studying the behavior of non-modular Eisenstein series that appear in…

In these lectures three different methods of computing the asymptotic expansion of a Hermitian matrix integral is presented. The first one is a combinatorial method using Feynman diagrams. This leads us to the generating function of the…

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…

In this paper, we enumerate Newton polygons asymptotically. The number of Newton polygons is computable by a simple recurrence equation, but unexpectedly the asymptotic formula of its logarithm contains growing oscillatory terms. As the…

A partition is $t$-regular if none of its parts is divisible by $t$. Let $p(N,t)$ be the number of $(t+1)$-regular partitions of a positive integer $N$. In 1971, Hagis proved an asymptotic formula for $p(N,t)$ using the circle method, when…

Recently, Debruyne and Tenenbaum proved asymptotic formulas for the number of partitions with parts in $\mathcal{L}\subset\mathbb{N}$ ($\gcd(\mathcal{L})=1$) and good analytic properties of the corresponding zeta function, generalizing work…

We use the Circle Method to derive asymptotic formulas for functions related to the number of parts of partitions in particular residue classes.

Following the ideas of Rosenbloom [7] and Hayman [5], Luis B\'aez-Duarte gives in [1] a probabilistic proof of Hardy-Ramanujan's asymptotic formula for the partitions of an integer. The main principle of the method relies on the convergence…

Recent work of Cesana, Craig and the third author shows that the trace of plane partitions is asymptotically equidistributed in residue classes mod $b$. Applying a technique of the first two authors and Garnowski, we prove asymptotic…

We propose a formula for finding the horizontal, oblique or curvilinear asymptote of any rational polynomial function of any positive degree, as a sum of matrix determinants formed directly from the coefficients of the terms in the given…

Asymptotic tensor rank is notoriously difficult to determine. Indeed, determining its value for the $2\times 2$ matrix multiplication tensor would determine the matrix multiplication exponent, a long-standing open problem. On the other…

Using the steepest descent method for oscillatory Riemann-Hilbert problems introduced by Deift and Zhou [Ann. Math. {\bf 137}(1993), 295-368], we derive asymptotic formulas for the Meixner polynomials in two regions of the complex plane…

Let $p(n)$ denote the partition function. In this paper our main goal is to derive an asymptotic expansion up to order $N$ (for any fixed positive integer $N$) along with estimates for error bounds for the shifted quotient of the partition…