The boundary length and point spectrum enumeration of partial chord diagrams using cut and join recursion

MaRDI QIDQ5283754zbMATHFDO

Authors J. E. Andersen, Hiroyuki Fuji, Christian M. Reidys, Robert Penner

Publication date 24 July 2017

Full work available at URL https://arxiv.org/abs/1612.06482

zbMATH Keywords

chord diagramfatgraphcut and join equation

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

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.

Recommendations

• Partial chord diagrams and matrix models
• Enumeration of chord diagrams on many intervals and their non-orientable analogs
• Publication:4502534
• Enumeration of chord diagrams via topological recursion and quantum curve technique
• Linear \(k\)-chord diagrams

Cited in

(1)

• Partial chord diagrams and matrix models

This page was built for publication: The boundary length and point spectrum enumeration of partial chord diagrams using cut and join recursion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283754)