%0 Journal Article
%T Enumeration of chord diagrams
%A Andrei Khruzin
%J Mathematics
%D 2000
%I arXiv
%X 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.
%U http://arxiv.org/abs/math/0008209v1