{
  "id": "0808.1157",
  "version": "v1",
  "published": "2008-08-08T06:40:36.000Z",
  "updated": "2008-08-08T06:40:36.000Z",
  "title": "Enumeration of $(k,2)$-noncrossing partitions",
  "authors": [
    "Toufik Mansour",
    "Simone Severini"
  ],
  "comment": "9 pages, 1 table",
  "journal": "Discrete Mathematics 308:20 (2008) 4570-4577",
  "categories": [
    "math.CO"
  ],
  "abstract": "A set partition is said to be $(k,d)$-noncrossing if it avoids the pattern $12... k12... d$. We find an explicit formula for the ordinary generating function of the number of $(k,d)$-noncrossing partitions of $\\{1,2,...,n\\}$ when $d=1,2$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2008-08-08T06:40:36.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A05",
      "05A15"
    ],
    "keywords": [
      "noncrossing partitions",
      "enumeration",
      "set partition"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 9,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2008arXiv0808.1157M"
    }
  }
}