{
  "id": "1005.4046",
  "version": "v1",
  "published": "2010-05-21T19:15:40.000Z",
  "updated": "2010-05-21T19:15:40.000Z",
  "title": "Generating trees and pattern avoidance in alternating permutations",
  "authors": [
    "Joel Brewster Lewis"
  ],
  "comment": "21 pages. To be presented at FPSAC 2010. Comments welcomed",
  "journal": "Electronic Journal of Combinatorics 19, P21 (2012)",
  "categories": [
    "math.CO"
  ],
  "abstract": "We extend earlier work of the same author to enumerate alternating permutations avoiding the permutation pattern 2143. We use a generating tree approach to construct a recursive bijection between the set A_{2n}(2143) of alternating permutations of length 2n avoiding 2143 and standard Young tableaux of shape (n, n, n) and between the set A_{2n + 1}(2143) of alternating permutations of length 2n + 1 avoiding 2143 and shifted standard Young tableaux of shape (n + 2, n + 1, n). We also give a number of conjectures and open questions on pattern avoidance in alternating permutations and generalizations thereof.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2010-05-21T19:15:40.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A05"
    ],
    "keywords": [
      "alternating permutations",
      "pattern avoidance",
      "length 2n",
      "extend earlier work",
      "shifted standard young tableaux"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 21,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2010arXiv1005.4046B"
    }
  }
}