{
  "id": "math/0612466",
  "version": "v2",
  "published": "2006-12-16T12:21:59.000Z",
  "updated": "2007-01-12T14:41:07.000Z",
  "title": "On a class of infinite words with affine factor complexity",
  "authors": [
    "J. Bernat",
    "Z. Masáková",
    "E. Pelantová"
  ],
  "comment": "14 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "In this article, we consider the factor complexity of a fixed point of a primitive substitution canonically defined by a beta-numeration system. We provide a necessary and sufficient condition on the Renyi expansion of 1 for having an affine factor complexity map C(n), that is, such that C(n)=an+b for any integer n.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2007-01-12T14:41:07.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "11A63",
      "11A67",
      "37B10",
      "68R15"
    ],
    "keywords": [
      "infinite words",
      "affine factor complexity map",
      "sufficient condition",
      "renyi expansion",
      "beta-numeration system"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 14,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2006math.....12466B"
    }
  }
}