Related papers: Asymptotics of the partition function for random m…

The Hardy-Ramanujan partition function asymptotics is a famous result in the asymptotics of combinatorial sequences. It was originally derived using complex analysis and number-theoretic ideas by Hardy and Ramanujan. It was later re-derived…

We establish Tracy-Widom asymptotics for the partition function of a random polymer model with gamma-distributed weights recently introduced by Sepp\"al\"ainen. We show that the partition function of this random polymer can be represented…

Maps are polygonal cellular networks on Riemann surfaces. This paper analyzes the construction of closed form general representations for the enumerative generating functions associated to maps of fixed but arbitrary genus. The method of…

We construct a probability model seemingly unrelated to the considered stochastic process of coagulation and fragmentation. By proving for this model the local limit theorem, we establish the asymptotic formula for the partition function of…

$\bar\partial$-extension of the matrix Riemann-Hilbert method is used to study asymptotics of the polynomials $P_n(z)$ satisfying orthogonality relations \[ \int_{-1}^1 x^lP_n(x)\frac{\rho(x)dx}{\sqrt{1-x^2}}=0, \quad l\in\{0,\ldots,n-1\},…

Asymptotic expansions are given for large values of $n$ of the generalized Bessel polynomials $Y_n^\mu(z)$. The analysis is based on integrals that follow from the generating functions of the polynomials. A new simple expansion is given…

We develop a new method for studying the asymptotics of symmetric polynomials of representation-theoretic origin as the number of variables tends to infinity. Several applications of our method are presented: We prove a number of theorems…

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…

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…

We derive semiclassical asymptotics for the orthogonal polynomials P_n(z) on the line with respect to the exponential weight \exp(-NV(z)), where V(z) is a double-well quartic polynomial, in the limit when n, N \to \infty. We assume that…

The generating function which counts partitions with the Plancherel measure (and its q-deformed version), can be rewritten as a matrix integral, which allows to compute its asymptotic expansion to all orders. There are applications in…

For a finite random graph, we defined a simple model of statistical mechanics. We obtain an annealed asymptotic result for the random partition function for this model on finite random graphs as n; the size of the graph is very large. To…

Here we examine the number of ways to partition an integer $n$ into $k$th powers when $n$ is large. Simplified proofs of some asymptotic results of Wright are given using the saddle-point method, including exact formulas for the expansion…

A theorem of Meinardus provides asymptotics of the number of weighted partitions under certain assumptions on associated ordinary and Dirichlet generating functions. The ordinary generating functions are closely related to Euler's…

In this paper, we are interested in matrix valued orthogonal polynomials on the real line with respect to exponential weights. We obtain strong asymptotics as the degree tends to infinity in different regions of the complex plane, as well…

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 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.

We establish necessary and sufficient conditions for convergence (in the sense of finite dimensional distributions) of multiplicative measures on the set of partitions. We show that this convergence is equivalent to asymptotic independence…

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 compute all massive partition functions or characteristic polynomials and their complex eigenvalue correlation functions for non-Hermitean extensions of the symplectic and chiral symplectic ensemble of random matrices. Our results are…