arXiv Analytics

Sign in

arXiv:math/0008209 [math.CO]AbstractReferencesReviewsResources

Enumeration of chord diagrams

Andrei Khruzin

Published 2000-08-28Version 1

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.

Comments: 10 pages, Latex, uses PSTricks
Categories: math.CO, math.QA
Subjects: 05A15, 05C25
Related articles: Most relevant | Search more
arXiv:math/9810143 [math.CO] (Published 1998-10-23)
Enumeration of tilings of diamonds and hexagons with defects
arXiv:math/9904150 [math.CO] (Published 1999-04-27, updated 1999-04-28)
Enumeration of Matchings: Problems and Progress
arXiv:math/9804119 [math.CO] (Published 1998-04-24, updated 1999-01-28)
Enumeration of m-ary cacti

Links

Toolbox