相关论文: Twenty combinatorial examples of asymptotics deriv…

The results of part I (hep-ph/9612284) are used to obtain full asymptotic expansions of Feynman diagrams renormalized within the MS-scheme in the regimes when some of the masses and external momenta are large with respect to the others. The…

We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…

We obtain an asymptotic expansion for $p(n)$, the number of partitions of a natural number $n$, starting from a formula that relates its generating function $f(t), t\in (0,1)$ with the characteristic functions of a family of sums of…

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…

Asymptotic expansions are derived for associated Legendre functions of degree $\nu$ and order $\mu$, where one or the other of the parameters is large. The expansions are uniformly valid for unbounded real and complex values of the argument…

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…

Let $f_1,\ldots,f_k : \mathbb{N} \rightarrow \mathbb{C}$ be multiplicative functions taking values in the closed unit disc. Using an analytic approach in the spirit of Hal\'{a}sz' mean value theorem, we compute multidimensional averages of…

We consider the enumeration of walks on the non-negative lattice $\mathbb{N}^d$, with steps defined by a set $\mathcal{S} \subset \{-1, 0, 1\}^d \setminus \{\mathbf{0}\}$. Previous work in this area has established asymptotics for the…

The field of analytic combinatorics is dedicated to the creation of effective techniques to study the large-scale behaviour of combinatorial objects. Although classical results in analytic combinatorics are mainly concerned with univariate…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

We extend the scope of analytic combinatorics to classes containing objects that have irrational sizes. The generating function for such a class is a power series that admits irrational exponents (which we call a Ribenboim series). A…

A ``hybrid method'', dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux's method and singularity analysis theory. This hybrid method applies to functions that remain of…

We enumerate the connected graphs that contain a linear number of edges with respect to the number of vertices. So far, only the first term of the asymptotics was known. Using analytic combinatorics, i.e. generating function manipulations,…

The generating function of the cumulants in random matrix models, as well as the cumulants themselves, can be expanded as asymptotic (divergent) series indexed by maps. While at fixed genus the sums over maps converge, the sums over genera…

Using a recently derived integral in terms of elementary functions, we derive new asymptotic expansions of the normal inverse Gaussian cumulative distribution function. One of the asymptotic representations is in terms of the normal…

In this paper we consider asymptotic expansions for a class of sequences of symmetric functions of many variables. Applications to classical and free probability theory are discussed.

We combine tools from homotopy continuation solvers with the methods of analytic combinatorics in several variables to give the first practical algorithm and implementation for the asymptotics of multivariate rational generating 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 construct asymptotic expansions for ordinary differential equations with highly oscillatory forcing terms, focussing on the case of multiple, non-commensurate frequencies. We derive an asymptotic expansion in inverse powers of the…

Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…