{
  "id": "math/0610462",
  "version": "v1",
  "published": "2006-10-15T21:49:34.000Z",
  "updated": "2006-10-15T21:49:34.000Z",
  "title": "The number of permutations with a given number of sequences",
  "authors": [
    "Marcus Kollar"
  ],
  "comment": "5 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "P(n,s) denotes the number of permutations of 1,2,...n that have exactly s sequences. Canfield and Wilf [math.CO/0609704] recently showed that P(n,s) can be written as a sum of s polynomials in n. We determine these polynomials explicitly and also obtain explicit expressions for P(n,s) and its fixed-s generating function u_s(x).",
  "revisions": [
    {
      "version": "v1",
      "updated": "2006-10-15T21:49:34.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A15"
    ],
    "keywords": [
      "permutations",
      "fixed-s generating function",
      "explicit expressions",
      "polynomials"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 5,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2006math.....10462K"
    }
  }
}