Enumeration of chord diagrams
Abstract
Description
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
10 pages, Latex, uses PSTricks