{
  "id": "math/0212221",
  "version": "v1",
  "published": "2002-12-16T23:39:44.000Z",
  "updated": "2002-12-16T23:39:44.000Z",
  "title": "Fixed points and excedances in restricted permutations",
  "authors": [
    "Sergi Elizalde"
  ],
  "comment": "12 pages, 10 figures, submitted to FPSAC'03",
  "categories": [
    "math.CO"
  ],
  "abstract": "In this paper we prove that among the permutations of length n with i fixed points and j excedances, the number of 321-avoiding ones equals the number of 132-avoiding ones, for all given i,j<=n. We use a new technique involving diagonals of non-rational generating functions. This theorem generalizes a recent result of Robertson, Saracino and Zeilberger, for which we also give another, more direct proof.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2002-12-16T23:39:44.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A15"
    ],
    "keywords": [
      "fixed points",
      "restricted permutations",
      "excedances",
      "non-rational generating functions",
      "theorem generalizes"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 12,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2002math.....12221E"
    }
  }
}