Enumeration of chord diagrams

Abstract

We determine the number of nonequivalent chord diagrams of order $n$ under the action of two groups, $C_{2n}$, a cyclic group of order $2n$, and $D_{2n}$, a dihedral group of order $4n$. Asymptotic formulas are also established.

10 pages, Latex, uses PSTricks

Cited by in corpus (2)

• Improved enumeration of simple topological graphs
• Topology of Functions with Isolated Critical Points on the Boundary of a 2-Dimensional Manifold