{
  "id": "1710.08820",
  "version": "v1",
  "published": "2017-10-24T15:01:32.000Z",
  "updated": "2017-10-24T15:01:32.000Z",
  "title": "Permutation complexity of images of Sturmian words by marked morphisms",
  "authors": [
    "Adam Borchert",
    "Narad Rampersad"
  ],
  "comment": "8 pages",
  "categories": [
    "math.CO",
    "cs.FL"
  ],
  "abstract": "We show that the permutation complexity of the image of a Sturmian word by a binary marked morphism is $n+k$ for some constant $k$ and all lengths $n$ sufficiently large.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-10-24T15:01:32.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "68R15"
    ],
    "keywords": [
      "sturmian word",
      "permutation complexity",
      "binary marked morphism"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 8,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}