Palindromic complexity of infinite words associated with non-simple Parry numbers
Abstract
We study the palindromic complexity of infinite words uβ, the fixed points of the substitution over a binary alphabet, φ(0)=0a1, φ(1)=0b1, with a-1≥ b≥ 1, which are canonically associated with quadratic non-simple Parry numbers β.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.