Asymptotic Transfer in Critical Recursive Composition Schemes
Michael Drmota, Z\'ephyr Salvy

TL;DR
This paper investigates how critical composition schemes in combinatorial enumeration influence the transfer of singularity structures and statistical properties, such as central limit theorems, especially in the context of map enumeration.
Contribution
It establishes a precise connection between the singularities of multivariate generating functions in critical compositions and the transfer of statistical properties like CLTs in map enumeration.
Findings
3/2-singularities transfer between composed generating functions
Critical composition schemes induce condensation phenomena in maps
Method applies to various face and pattern counting statistics
Abstract
The composition of two combinatorial classes and is a standard combinatorial construction and translates into the composition of their corresponding counting generating functions. Such a composition is called critical if , where and denote the corresponding radii of convergences of and , respectively. In this case, both the singular behaviours of and influence that of . Such critical decomposition schemes appear quite frequently in the context of map enumeration. For example by using the block-decomposition one has and , where denotes the generating series of all rooted planar maps and the generating series of -connected rooted planar maps. This can be extended to multivariate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Stochastic processes and statistical mechanics · Random Matrices and Applications
