Related papers: Multiple Scale Asymptotics of Map Enumeration
The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. When restricted to graphs and their shortest paths metric, the asymptotic dimension can be seen as a large scale…
Asymptotic expansions are derived for Gegenbauer (ultraspherical) polynomials for large order $n$ that are uniformly valid for unbounded complex values of the argument $z$, including the real interval $0 \leq z \leq 1$ in which the zeros in…
Asymptotic approximations of Jacobi polynomials are given in terms of elementary functions for large degree $n$ and parameters $\alpha$ and $\beta$. From these new results, asymptotic expansions of the zeros are derived and methods are…
We present a complete set of criteria for determining A-types of plane-to-plane map-germs of corank one with A-codimension <7, which provides a new insight into the A-classification theory from the viewpoint of recognition problem. As an…
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…
We completely generalize previous results related to the counting of connected Feynman diagrams. We use a generating function approach, which encodes the Wick contraction combinatorics of the respective connected diagrams. Exact solutions…
In this paper, we introduce a notion of expansion for groupoids, which recovers the classical notion of expander graphs by a family of pair groupoids and expanding actions in measure by transformation groupoids. We also consider an…
The Carrell-Chapuy recurrence formulas dramatically improve the efficiency of counting orientable rooted maps by genus, either by number of edges alone or by number of edges and vertices. This paper presents an implementation of these…
Traditionally, autonomous reconnaissance applications have acted on explicit sets of historical observations. Aided by recent breakthroughs in generative technologies, this work enables robot teams to act beyond what is currently known…
Catalytic equations appear in several combinatorial applications, most notably in the numeration of lattice path and in the enumeration of planar maps. The main purpose of this paper is to show that the asymptotic estimate for the…
We prove combinatorially the explicit relation between genus filtrated $s$-loop means of the Gaussian matrix model and terms of the genus expansion of the Kontsevich--Penner matrix model (KPMM). The latter is the generating function for…
We study enumeration functions for unimodal sequences of positive integers, where the size of a sequence is the sum of its terms. We survey known results for a number of natural variants of unimodal sequences, including Auluck's generalized…
Our work studies the enumeration and random generation of unlabeled combinatorial classes of unrooted graphs. While the technique of vertex pointing provides a straightforward procedure for analyzing a labeled class of unrooted graphs by…
This preprint is the introduction of my habilitation thesis for Paris7 university. It is a sumary of a collection of works on the 2 matrix model. In an introduction, 3 different and unequivalent definitions of matrix models are given…
Asymptotic expansions are derived for the tail distribution of the product of two correlated normal random variables with non-zero means and arbitrary variances, and more generally the sum of independent copies of such random variables.…
We adapt the notion of generating functions for lagrangian submanifolds to symplectic microgeometry. We show that a symplectic micromorphism always admits a global generating function. As an application, we describe hamiltonian flows as…
In recent years, semantic segmentation has become a pivotal tool in processing and interpreting satellite imagery. Yet, a prevalent limitation of supervised learning techniques remains the need for extensive manual annotations by experts.…
Using the generalized method of steepest descents for the case of two coalescing saddle points, we derive an asymptotic expression for the bivariate generating function of Dyck paths, weighted according to their length and their area in the…
We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…
We develop a nonstandard approach to exploring polynomials associated with peaks and runs of permutations. With the aid of a context-free grammar, or a set of substitution rules, one can perform a symbolic calculus, and the computation…