{
  "id": "1409.4725",
  "version": "v1",
  "published": "2014-09-16T18:37:26.000Z",
  "updated": "2014-09-16T18:37:26.000Z",
  "title": "A simple proof of a theorem of Schmerl and Trotter for permutations",
  "authors": [
    "Robert Brignall",
    "Vincent Vatter"
  ],
  "comment": "To appear in the Journal of Combinatorics",
  "categories": [
    "math.CO"
  ],
  "abstract": "When specialized to the context of permutations, Schmerl and Trotter's Theorem states that every simple permutation which is not a parallel alternation contains a simple permutation with one fewer entry. We give an elementary proof of this result.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-09-16T18:37:26.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "simple proof",
      "simple permutation",
      "trotters theorem states",
      "parallel alternation contains",
      "fewer entry"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1409.4725B"
    }
  }
}