## Abstract

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 construction developed here involves a novel asymptotic symbol calculus for difference operators based on the relation between spectral asymptotics for Hermitian random matrices and asymptotics of orthogonal polynomials with exponential weights. These closed form expressions have a universal character in the sense that they are independent of the explicit valence distribution of the cellular networks within a broad class. Nevertheless the valence distributions may be recovered from the closed form generating functions by a remarkable unwinding identity in terms of Appell polynomials generated by Bessel functions. Our treatment reveals the generating functions to be solutions of nonlinear conservation laws and their prolongations. This characterization enables one to gain insights that go beyond more traditional methods that are purely combinatorial. Universality results are connected to stability results for characteristic singularities of conservation laws that were studied by Caflisch, Ercolani, Hou and Landis, Multi-valued solutions and branch point singularities for nonlinear hyperbolic or elliptic systems, Commun. Pure Appl. Math. 46 (1993) 453-499, as well as directly related to universality results for random matrix spectra.

Original language | English (US) |
---|---|

Article number | 2250037 |

Journal | Random Matrices: Theory and Application |

Volume | 11 |

Issue number | 4 |

DOIs | |

State | Published - Oct 1 2022 |

## Keywords

- Appell polynomials
- Hopf algebras
- Motzkin paths
- Random matrices
- Toda lattices
- combinatorial generating functions
- conservation law hierarchies
- map enumeration
- orthogonal polynomials
- string equations

## ASJC Scopus subject areas

- Algebra and Number Theory
- Statistics and Probability
- Statistics, Probability and Uncertainty
- Discrete Mathematics and Combinatorics