CaltechAUTHORS
  A Caltech Library Service

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

Alexeev, N. V. and Andersen, J. E. and Penner, R. C. and Zograf, P. G. (2016) Enumeration of chord diagrams on many intervals and their non-orientable analogs. Advances in Mathematics, 289 . pp. 1056-1081. ISSN 0001-8708. https://resolver.caltech.edu/CaltechAUTHORS:20160218-150306233

[img] PDF - Submitted Version
See Usage Policy.

293Kb

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20160218-150306233

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.


Item Type:Article
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1016/j.aim.2015.11.032DOIArticle
http://www.sciencedirect.com/science/article/pii/S0001870815004971PublisherArticle
http://arxiv.org/abs/1307.0967arXivDiscussion Paper
Additional Information:© 2015 Elsevier Inc. Research supported by the Centre for Quantum Geometry of Moduli Spaces which is funded by the Danish National Research Foundation. The work of N.A. and P.Z. was further supported by the Government of the Russian Federation megagrant 11.G34.31.0026, by JSC “Gazprom Neft”, and by the RFBR grants 13-01-00935-a and 13-01-12422-OFI-M2. In addition, N.A. was partially supported by the RFBR grant 14-01-00500-a and by the SPbSU grant 6.38.672.2013, and P.Z. was partially supported by the RFBR grant 14-01-00373-a.
Funders:
Funding AgencyGrant Number
Danish National Research FoundationUNSPECIFIED
Russian Federation11.G34.31.0026
JSCUNSPECIFIED
Russian Foundation for Basic Research (RFBR)14-01-00500-a
Saint Petersburg State University (SPbSU)6.38.672.2013
Russian Foundation for Basic Research (RFBR)14-01-00373-a
Subject Keywords:Chord diagrams; Polygon gluings; Random matrices
Record Number:CaltechAUTHORS:20160218-150306233
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20160218-150306233
Official Citation:N.V. Alexeev, J.E. Andersen, R.C. Penner, P.G. Zograf, Enumeration of chord diagrams on many intervals and their non-orientable analogs, Advances in Mathematics, Volume 289, 5 February 2016, Pages 1056-1081, ISSN 0001-8708, http://dx.doi.org/10.1016/j.aim.2015.11.032. (http://www.sciencedirect.com/science/article/pii/S0001870815004971)
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:64590
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:18 Feb 2016 23:17
Last Modified:03 Oct 2019 09:39

Repository Staff Only: item control page