Abelian Complexity of Infinite Words Associated with Quadratic Parry Numbers
Abstract
We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.