{
  "id": "math/0611508",
  "version": "v1",
  "published": "2006-11-16T17:05:07.000Z",
  "updated": "2006-11-16T17:05:07.000Z",
  "title": "Palindromic complexity of infinite words associated with non-simple Parry numbers",
  "authors": [
    "L'ubom{\\'ı}ra Balková",
    "Zuzana Masáková"
  ],
  "comment": "16 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "We study the palindromic complexity of infinite words $u_\\beta$, the fixed points of the substitution over a binary alphabet, $\\phi(0)=0^a1$, $\\phi(1)=0^b1$, with $a-1\\geq b\\geq 1$, which are canonically associated with quadratic non-simple Parry numbers $\\beta$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2006-11-16T17:05:07.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "68R15",
      "11A63"
    ],
    "keywords": [
      "infinite words",
      "palindromic complexity",
      "quadratic non-simple parry numbers",
      "binary alphabet",
      "substitution"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 16,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2006math.....11508B"
    }
  }
}