Enumeration of chord diagrams via topological recursion and quantum curve techniques
J{\o}rgen Ellegaard Andersen, Hiroyuki Fuji, Masahide Manabe, Robert, C. Penner, Piotr Su{\l}kowski

TL;DR
This paper develops methods using topological recursion and quantum curves to systematically count orientable and non-orientable chord diagrams, linking matrix models to topological enumeration.
Contribution
It introduces a novel approach combining topological recursion and quantum curve techniques to enumerate chord diagrams via matrix models.
Findings
Efficient algorithms for counting chord diagrams with specified genus, backbones, and chords.
Connection established between matrix model expectation values and topological enumeration.
Independent validation of methods using both topological recursion and quantum curves.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Topological and Geometric Data Analysis · Algorithms and Data Compression
