Counting unlabelled chord diagrams of maximal genus

DOI10.1007/s10958-018-4129-xzbMath1410.05006arXiv1709.00796OpenAlexW2963565394MaRDI QIDQ2632548

Evgeniy Krasko

Publication date: 14 May 2019

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

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

zbMATH Keywords

maximal chord diagrams

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Cites Work

• A recursion formula for the moments of the Gaussian orthogonal ensemble
• Counting unrooted planar maps
• On general dissections of a polygon
• Counting non-isomorphic chord diagrams
• The Euler characteristic of the moduli space of curves
• A reductive technique for enumerating non-isomorphic planar maps
• Enumeration of unrooted maps of a given genus
• Counting rooted maps by genus. I

This page was built for publication: Counting unlabelled chord diagrams of maximal genus