{
  "id": "0812.0143",
  "version": "v2",
  "published": "2008-11-30T15:00:08.000Z",
  "updated": "2009-02-03T15:59:28.000Z",
  "title": "Permutations sortable by n-4 passes through a stack",
  "authors": [
    "Anders Claesson",
    "Mark Dukes",
    "Einar Steingrimsson"
  ],
  "comment": "6 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "We characterise and enumerate permutations that are sortable by n-4 passes through a stack. We conjecture the number of permutations sortable by n-5 passes, and also the form of a formula for the general case n-k, which involves a polynomial expression.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2009-02-03T15:59:28.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "permutations sortable",
      "general case n-k",
      "enumerate permutations",
      "polynomial expression",
      "characterise"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 6,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2008arXiv0812.0143C"
    }
  }
}