{
  "id": "math/0302014",
  "version": "v1",
  "published": "2003-02-02T07:26:57.000Z",
  "updated": "2003-02-02T07:26:57.000Z",
  "title": "Restricted even permutations and Chebyshev polynomials",
  "authors": [
    "Toufik Mansour"
  ],
  "comment": "20 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "We study generating functions for the number of even (odd) 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": "v1",
      "updated": "2003-02-02T07:26:57.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A05",
      "05A15",
      "30B70",
      "42C05"
    ],
    "keywords": [
      "chebyshev polynomials",
      "study generating functions",
      "generating function depends",
      "arbitrary permutation"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 20,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2003math......2014M"
    }
  }
}