A PDE approach to the combinatorics of the full map enumeration problem: Exact solutions and their universal character

Nicholas M. Ercolani, Patrick Waters

Research output: Contribution to journalArticlepeer-review

Abstract

Maps are polygonal cellular networks on Riemann surfaces. This paper completes a program of constructing closed form general representations for the enumerative generating functions associated to maps of fixed but arbitrary genus. These closed form expressions have a universal character in the sense that they are independent of the explicit valence distribution of the tiling polygons. Nevertheless the valence distributions may be recovered from the closed form generating functions by a remarkable unwinding identity in terms of the Appell polynomials generated by Bessel functions. Our treatment, based on random matrix theory and Riemann-Hilbert problems for orthogonal polynomials 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 [14] as well as directly related to universality results for random matrix spectra as described by Deift et al [20].

Original languageEnglish (US)
JournalUnknown Journal
StatePublished - Jul 18 2019

Keywords

  • Appell polynomials
  • Combinatorial generating functions
  • Conservation law hierarchies
  • Hopf algebras
  • Map enumeration
  • Motzkin paths
  • Orthogonal polynomials
  • Random matrices
  • String equations
  • Toda lattices

ASJC Scopus subject areas

  • General

Fingerprint Dive into the research topics of 'A PDE approach to the combinatorics of the full map enumeration problem: Exact solutions and their universal character'. Together they form a unique fingerprint.

Cite this