English

Enumeration of linear chord diagrams

Combinatorics 2010-10-28 v1

Abstract

A linear chord diagram canonically determines a fatgraph and hence has an associated genus gg. We compute the natural generating function Cg(z)=n0cg(n)zn{\bf C}_g(z)=\sum_{n\geq 0} {\bf c}_g(n)z^n for the number cg(n){\bf c}_g(n) of linear chord diagrams of fixed genus g1g\geq 1 with a given number n0n\geq 0 of chords and find the remarkably simple formula Cg(z)=z2gRg(z)(14z)123g{\bf C}_g(z)=z^{2g}R_g(z) (1-4z)^{{1\over 2}-3g}, where Rg(z)R_g(z) is a polynomial of degree at most g1g-1 with integral coefficients satisfying Rg(14)0R_g({1\over 4})\neq 0 and Rg(0)=cg(2g)0.R_g(0) = {\bf c}_g(2g)\neq 0. In particular, Cg(z){\bf C}_g(z) is algebraic over C(z)\mathbb C(z), which generalizes the corresponding classical fact for the generating function C0(z){\bf C}_0(z) of the Catalan numbers. As a corollary, we also calculate a related generating function germaine to the enumeration of knotted RNA secondary structures, which is again found to be algebraic.

Keywords

Cite

@article{arxiv.1010.5614,
  title  = {Enumeration of linear chord diagrams},
  author = {J. E. Andersen and R. C. Penner and C. M. Reidys and M. S. Waterman},
  journal= {arXiv preprint arXiv:1010.5614},
  year   = {2010}
}