{
  "id": "0710.1370",
  "version": "v4",
  "published": "2007-10-06T14:57:51.000Z",
  "updated": "2011-05-05T15:17:45.000Z",
  "title": "A problem of enumeration of two-color bracelets with several variations",
  "authors": [
    "Vladimir Shevelev"
  ],
  "comment": "16 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "We consider the problem of enumeration of incongruent two-color bracelets of $n$ beads, $k$ of which are black, and study several natural variations of this problem. We also give recursion formulas for enumeration of $t$-color bracelets, $t\\geq3.",
  "revisions": [
    {
      "version": "v4",
      "updated": "2011-05-05T15:17:45.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A15",
      "11B39"
    ],
    "keywords": [
      "enumeration",
      "incongruent two-color bracelets",
      "recursion formulas",
      "natural variations"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 16,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2007arXiv0710.1370S"
    }
  }
}