{
  "id": "math/0208006",
  "version": "v3",
  "published": "2002-08-01T07:52:54.000Z",
  "updated": "2002-10-15T17:52:22.000Z",
  "title": "On the diagram of 132-avoiding permutations",
  "authors": [
    "Astrid Reifegerste"
  ],
  "comment": "20 pages; additional reference is added",
  "categories": [
    "math.CO"
  ],
  "abstract": "The diagram of a 132-avoiding permutation can easily be characterized: it is simply the diagram of a partition. Based on this fact, we present a new bijection between 132-avoiding and 321-avoiding permutations. We will show that this bijection translates the correspondences between these permutations and Dyck paths given by Krattenthaler and by Billey-Jockusch-Stanley, respectively, to each other. Moreover, the diagram approach yields simple proofs for some enumerative results concerning forbidden patterns in 132-avoiding permutations.",
  "revisions": [
    {
      "version": "v3",
      "updated": "2002-10-15T17:52:22.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A05",
      "05A15"
    ],
    "keywords": [
      "permutation",
      "diagram approach yields simple proofs",
      "enumerative results concerning forbidden patterns",
      "bijection translates"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 20,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2002math......8006R"
    }
  }
}