Enumeration of chord diagrams via topological recursion and quantum curve technique
zbMATH Open1381.05035arXiv1612.05839MaRDI QIDQ5283756FDOQ5283756
Authors: J. E. Andersen, Hiroyuki Fuji, Masahide Manabe, Piotr Sulkowski, Robert Penner
Publication date: 24 July 2017
Full work available at URL: https://arxiv.org/abs/1612.05839
Recommendations
chord diagramtopological recursion\(\beta\)-deformationfatgraphquantum curvenon-oriented chord diagram
Exact enumeration problems, generating functions (05A15) Planar graphs; geometric and topological aspects of graph theory (05C10) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30) Feynman diagrams (81T18) Topological field theories in quantum mechanics (81T45) Computational methods for problems pertaining to biology (92-08)
Cited In (5)
- Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings
- Counting unlabelled chord diagrams of maximal genus
- Partial chord diagrams and matrix models
- Topological recursion for chord diagrams, RNA complexes, and cells in moduli spaces
- ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
This page was built for publication: Enumeration of chord diagrams via topological recursion and quantum curve technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283756)