{
  "id": "math/0008209",
  "version": "v1",
  "published": "2000-08-28T18:08:43.000Z",
  "updated": "2000-08-28T18:08:43.000Z",
  "title": "Enumeration of chord diagrams",
  "authors": [
    "Andrei Khruzin"
  ],
  "comment": "10 pages, Latex, uses PSTricks",
  "categories": [
    "math.CO",
    "math.QA"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2000-08-28T18:08:43.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A15",
      "05C25"
    ],
    "keywords": [
      "enumeration",
      "nonequivalent chord diagrams",
      "cyclic group",
      "dihedral group"
    ],
    "note": {
      "typesetting": "LaTeX",
      "pages": 10,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2000math......8209K"
    }
  }
}