{"paper":{"title":"Palindromic complexity of infinite words associated with non-simple Parry numbers","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"L'ubom\\'ira Balkov\\'a, Zuzana Mas\\'akov\\'a","submitted_at":"2006-11-16T17:05:07Z","abstract_excerpt":"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$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0611508","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}