{
  "id": "math/9808080",
  "version": "v1",
  "published": "1998-08-17T21:03:36.000Z",
  "updated": "1998-08-17T21:03:36.000Z",
  "title": "The Enumeration of Permutations With a Prescribed Number of ``Forbidden'' Patterns",
  "authors": [
    "John Noonan",
    "Doron Zeilberger"
  ],
  "comment": "AMSTeX",
  "journal": "Advances in Applied Mathematics 17 (1996), 381-407",
  "categories": [
    "math.CO"
  ],
  "abstract": "We initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of `forbidden' patterns, that seems to indicate that the enumerating sequence is always P-recursive. We illustrate the method completely in terms of the patterns `abc',`cab' and `abcd'.",
  "revisions": [
    {
      "version": "v1",
      "updated": "1998-08-17T21:03:36.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "prescribed number",
      "permutations",
      "general approach",
      "fast enumeration",
      "occurrences"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "AMS-TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "1998math......8080N"
    }
  }
}