Partial chord diagrams and matrix models
arXiv:1612.05840
Abstract
In this article, the enumeration of partial chord diagrams is discussed via matrix model techniques. In addition to the basic data such as the number of backbones and chords, we also consider the Euler characteristic, the backbone spectrum, the boundary point spectrum, and the boundary length spectrum. Furthermore, we consider the boundary length and point spectrum that unifies the last two types of spectra. We introduce matrix models that encode generating functions of partial chord diagrams filtered by each of these spectra. Using these matrix models, we derive partial differential equations - obtained independently by cut-and-join arguments in an earlier work - for the corresponding generating functions.
arXiv comment42 pages, 14 figures
References in corpus (14)
- RNA Folding and Large N Matrix Theory
- Generation of Matrix Models by W-operators
- Enumeration of RNA structures by Matrix Models
- Spectral curves and the Schroedinger equations for the Eynard-Orantin recursion
- The spectral curve of the Eynard-Orantin recursion via the Laplace transform
- Topological recursion for chord diagrams, RNA complexes, and cells in moduli spaces
- Summing graphs for random band matrices
- Universality and asymptotics of graph counting problems in nonorientable surfaces
- Enumeration of RNA complexes via random matrix theory
- Enumeration of chord diagrams on many intervals and their non-orientable analogs
- Enumeration of linear chord diagrams
- Linear chord diagrams on two intervals
- Enumeration of chord diagrams via topological recursion and quantum curve techniques
- The boundary length and point spectrum enumeration of partial chord diagrams using cut and join recursion