{
  "id": "0909.2274",
  "version": "v1",
  "published": "2009-09-11T21:10:53.000Z",
  "updated": "2009-09-11T21:10:53.000Z",
  "title": "The number of permutations realized by a shift",
  "authors": [
    "Sergi Elizalde"
  ],
  "comment": "19 pages, 2 figures",
  "journal": "S. Elizalde, SIAM J. Discrete Math. 23 (2009), 765-786",
  "doi": "10.1137/080726689",
  "categories": [
    "math.CO",
    "math.DS"
  ],
  "abstract": "A permutation p is realized by the shift on N symbols if there is an infinite word on an N-letter alphabet whose successive left shifts by one position are lexicographically in the same relative order as p. The set of realized permutations is closed under consecutive pattern containment. Permutations that cannot be realized are called forbidden patterns. It was shown in [Amigo, Elizalde, Kennel, J. Combin. Theory Ser. A 115 (2008) 485-504] that the shortest forbidden patterns of the shift on N symbols have length N+2. In this paper we give a characterization of the set of permutations that are realized by the shift on N symbols, and we enumerate them according to their length.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2009-09-11T21:10:53.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A05",
      "05A15",
      "37M10",
      "94A55"
    ],
    "keywords": [
      "permutations",
      "shortest forbidden patterns",
      "infinite word",
      "n-letter alphabet",
      "theory ser"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 19,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009arXiv0909.2274E"
    }
  }
}