The boundary length and point spectrum enumeration of partial chord diagrams using cut and join recursion
arXiv:1612.06482
Abstract
We introduce the boundary length and point spectrum, as a joint generalization of the boundary length spectrum and boundary point spectrum in arXiv:1307.0967. We establish by cut-and-join methods that the number of partial chord diagrams filtered by the boundary length and point spectrum satisfies a recursion relation, which combined with an initial condition determines these numbers uniquely. This recursion relation is equivalent to a second order, non-linear, algebraic partial differential equation for the generating function of the numbers of partial chord diagrams filtered by the boundary length and point spectrum.
arXiv comment16 pages, 6 figures
References in corpus (9)
- RNA Folding and Large N Matrix Theory
- Enumeration of RNA structures by Matrix Models
- Topological recursion for chord diagrams, RNA complexes, and cells in moduli spaces
- 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
- Partial chord diagrams and matrix models