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

The generating function for restricted partitions is a finite product with a Laurent expansion at each root of unity. The question of the behavior of these Laurent coefficients as the size of the product increases goes back to Rademacher…

We reconsider the problem of calculating a general spectral correlation function containing an arbitrary number of products and ratios of characteristic polynomials for a N x N random matrix taken from the Gaussian Unitary Ensemble (GUE).…

We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…

Asymptotic properties of a vector of length power functionals of random geometric graphs are investigated. More precisely, its asymptotic covariance matrix is studied as the intensity of the underlying homogeneous Poisson point process…

We study a Hamiltonian describing a pendulum coupled with several anisochronous oscillators, devising an asymptotic expansion for the splitting (matrix) associated with a homoclinic point. This expansion consists of contributions that are…

In our recent work [SIGMA \textbf{20} (2024), 074, 13 pages], the leading behaviour of the Humbert function $\Psi_1[a,b;c,c';x,y]$ when $x\to\infty$ and $y\to +\infty$ has been derived in a direct and simple manner. In this paper, we obtain…

Using the steepest descent method of Deift-Zhou, we derive locally uniform asymptotic formulas for the Meixner polynomials. These include an asymptotic formula in a neighborhood of the origin, a result which as far as we are aware has not…

In deriving large n probability distribution function of the rightmost eigenvalue from the classical Random Matrix Theory Ensembles, one is faced with que question of finding large n asymptotic of certain coupled set of functions. This…

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

Many asymptotic formulas exist for unrestricted integer partitions as well as for distinct partitions of integers into a finite number of parts. Szekeres and Canfield have derived an asymptotic formula for the number of partitions that is…

We give a relatively short, almost self-contained proof of the fact that the partition function of the suitably renormalised $\Phi^4_3$ measure admits an asymptotic expansion, the coefficients of which converge as the ultraviolet cut-off is…

We compute the whole asymptotic expansion of the probability that a large uniform labeled graph is connected, and of the probability that a large uniform labeled tournament is irreducible. In both cases, we provide a combinatorial…

We consider large non-Hermitian random matrices $X$ with complex, independent, identically distributed centred entries and show that the linear statistics of their eigenvalues are asymptotically Gaussian for test functions having…

We consider the spherical integral of real symmetric or Hermitian matrices when the rank of one matrix is one. We prove the existence of the full asymptotic expansions of these spherical integrals and derive the first and the second term in…

In a previous work [J. Math. Phys. {\bf 35} (1994), 2539--2551], generalized hypergeometric functions have been used to a give a rigorous derivation of the large $s$ asymptotic form of the general $\beta > 0$ gap probability $E_\beta^{\rm…

We study Hermitian random matrix models with an external source matrix which has equispaced eigenvalues, and with an external field such that the limiting mean density of eigenvalues is supported on a single interval as the dimension tends…

Let $p_n$ be the number of partitions of an integer $n$. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting…

In this paper, we study the structure of the complete asymptotic expansion of the probability that a large combinatorial object is connected or consists of a given number of connected components. For rapidly growing labeled families of…

By application of the theory for second-order linear differential equations with two turning points developed in [Olver F.W.J., Philos. Trans. Roy. Soc. London Ser. A 278 (1975), 137-174], uniform asymptotic approximations are obtained in…

Integral means are important class of bivariate means. In this paper we prove the very general algorithm for calculation of coefficients in asymptotic expansion of integral mean. It is based on explicit solving the equation of the form…