{
  "id": "math/0010047",
  "version": "v2",
  "published": "2000-10-04T18:21:31.000Z",
  "updated": "2000-11-07T19:15:01.000Z",
  "title": "Restricted 132-avoiding permutations",
  "authors": [
    "T. Mansour",
    "A. Vainshtein"
  ],
  "comment": "10 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "We study generating functions for the number of permutations on n letters avoiding 132 and an arbitrary permutation $\\tau$ on k letters, or containing $\\tau$ exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2000-11-07T19:15:01.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A05",
      "05A15",
      "30B70",
      "42C05"
    ],
    "keywords": [
      "study generating functions",
      "second kind",
      "chebyshev polynomials",
      "arbitrary permutation"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 10,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2000math.....10047M"
    }
  }
}