Enumeration of chord diagrams via topological recursion and quantum curve technique
From MaRDI portal
Publication:5283756
\(\beta\)-deformationchord diagramfatgraphnon-oriented chord diagramquantum curvetopological recursion
Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Feynman diagrams (81T18) Topological field theories in quantum mechanics (81T45) Computational methods for problems pertaining to biology (92-08)
Abstract: In this paper we consider the enumeration of orientable and non-orientable chord diagrams. We show that this enumeration is encoded in appropriate expectation values of the -deformed Gaussian and RNA matrix models. We evaluate these expectation values by means of the -deformed topological recursion, and - independently - using properties of quantum curves. We show that both these methods provide efficient and systematic algorithms for counting of chord diagrams with a given genus, number of backbones and number of chords.
Recommendations
Cited in
(7)- Topological recursion for chord diagrams, RNA complexes, and cells in moduli spaces
- Counting unlabelled chord diagrams of maximal genus
- Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings
- ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
- The boundary length and point spectrum enumeration of partial chord diagrams using cut and join recursion
- Partial chord diagrams and matrix models
- Enumeration of chord diagrams on many intervals and their non-orientable analogs
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)