Enumeration of chord diagrams on many intervals and their non-orientable analogs

DOI10.1016/J.AIM.2015.11.032zbMATH Open1334.05005arXiv1307.0967OpenAlexW1615685064MaRDI QIDQ904038FDOQ904038

Authors: N. V. Alexeev, J. E. Andersen, Peter Zograf, Robert Penner 

Publication date: 15 January 2016

Published in: Advances in Mathematics (Search for Journal in Brave)

Abstract: Two types of connected chord diagrams with chord endpoints lying in a collection of ordered and oriented real segments are considered here: the real segments may contain additional bivalent vertices in one model but not in the other. In the former case, we record in a generating function the number of fatgraph boundary cycles containing a fixed number of bivalent vertices while in the latter, we instead record the number of boundary cycles of each fixed length. Second order, non-linear, algebraic partial differential equations are derived which are satisfied by these generating functions in each case giving efficient enumerative schemes. Moreover, these generating functions provide multi-parameter families of solutions to the KP hierarchy. For each model, there is furthermore a non-orientable analog, and each such model likewise has its own associated differential equation. The enumerative problems we solve are interpreted in terms of certain polygon gluings. As specific applications, we discuss models of several interacting RNA molecules. We also study a matrix integral which computes numbers of chord diagrams in both orientable and non-orientable cases in the model with bivalent vertices, and the large-N limit is computed using techniques of free probability.

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

Recommendations

• Enumeration of chord diagrams via topological recursion and quantum curve technique
• Topological recursion for chord diagrams, RNA complexes, and cells in moduli spaces
• Partial chord diagrams and matrix models
• Publication:4502534
• Linear \(k\)-chord diagrams

zbMATH Keywords

random matriceschord diagramspolygon gluings

Mathematics Subject Classification ID

Random matrices (algebraic aspects) (15B52) Exact enumeration problems, generating functions (05A15)

Cites Work

• Lectures on the Combinatorics of Free Probability
• Title not available (Why is that?)
• KP hierarchy for Hodge integrals
• The decorated Teichmüller space of punctured surfaces
• ABELIAN CONFORMAL FIELD THEORY AND DETERMINANT BUNDLES
• Transitive factorisations into transpositions and holomorphic mappings on the sphere
• Graphs on surfaces and their applications. Appendix by Don B. Zagier
• On the Vassiliev knot invariants
• The Euler characteristic of the moduli space of curves
• Topological recursion for chord diagrams, RNA complexes, and cells in moduli spaces
• Title not available (Why is that?)
• ON EQUIVALENCE OF TWO HURWITZ MATRIX MODELS
• The spectral curve of the Eynard-Orantin recursion via the Laplace transform
• RNA folding and large \(N\) matrix theory
• Title not available (Why is that?)
• A recursion formula for the moments of the Gaussian orthogonal ensemble
• Spaces of RNA secondary structures
• Fatgraph models of proteins
• The Poisson structure on the moduli space of flat connections and chord diagrams
• Finite type invariants and fatgraphs
• Quantization of the algebra of chord diagrams
• Invariant tensor formulas via chord diagrams
• Character expansion methods for matrix models of dually weighted graphs
• Gluings of surfaces with polygonal boundaries

Cited In (13)

• Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings
• Enumeration of chord diagrams via topological recursion and quantum curve technique
• Counting unlabelled chord diagrams of maximal genus
• Partial chord diagrams and matrix models
• The boundary length and point spectrum enumeration of partial chord diagrams using cut and join recursion
• Topological recursion for chord diagrams, RNA complexes, and cells in moduli spaces
• Moduli spaces and macromolecules
• ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
• Counting Bubbles in Linear Chord Diagrams
• Combinatorial solutions to integrable hierarchies
• The gluing of a surface of genus \(g\) from two and three polygons
• Title not available (Why is that?)
• On the number of Rumer diagrams

This page was built for publication: Enumeration of chord diagrams on many intervals and their non-orientable analogs

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