{
  "id": "1110.1219",
  "version": "v3",
  "published": "2011-10-06T10:49:56.000Z",
  "updated": "2012-03-10T10:07:26.000Z",
  "title": "Describing West-3-stack-sortable permutations with permutation patterns",
  "authors": [
    "Henning Úlfarsson"
  ],
  "comment": "20 pages, 7 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "We describe a new method for finding patterns in permutations that produce a given pattern after the permutation has been passed once through a stack. We use this method to describe West-3-stack-sortable permutations, that is, permutations that are sorted by three passes through a stack. We also show how the method can be applied to the bubble-sort operator. The method requires the use of mesh patterns introduced by Br\\\"and\\'en and Claesson (2011), as well as a new type of generalized pattern we call a decorated pattern.",
  "revisions": [
    {
      "version": "v3",
      "updated": "2012-03-10T10:07:26.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A15"
    ],
    "keywords": [
      "permutation patterns",
      "describing",
      "bubble-sort operator",
      "mesh patterns"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 20,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1110.1219U"
    }
  }
}