The boundary length and point spectrum enumeration of partial chord diagrams using cut and join recursion

Research output: Working paperResearch

  • Jørgen Ellegaard Andersen
  • Hiroyuki Fuji, Kagawa University, JapanRobert C. Penner, Institut des Hautes Études Scientifiques (IHÉS), CALTECH, California Institute of Technology, Mat Sci, United StatesChristian Reidys, Biocomplexity Institute of Virginia Tech, United States
We introduce the boundary length and point spectrum, as a joint generalization of the boundary length spectrum and boundary point spectrum in [1]. We establish by cut-and-join methods that the number of partial chord diagrams filtered by the boundary length and point spectrum satisfies a recursion relation, which combined with an initial condition determines these numbers uniquely. This recursion relation is equivalent to a second order, non-linear, algebraic partial differential equation for the generating function of the numbers of partial chord diagrams filtered by the boundary length and point spectrum.
Original languageEnglish
PublisherarXiv.org
Number of pages16
StatePublished - 20 Dec 2016

See relations at Aarhus University Citationformats

ID: 107471725