Abelian Complexity of Infinite Words Associated with Quadratic Parry Numbers
\v{L}ubom\'ira Balkov\'a, Karel B\v{r}inda, and Ond\v{r}ej Turek
TL;DR
This paper derives an explicit formula for the Abelian complexity of infinite words linked to quadratic Parry numbers, providing insights into their combinatorial structure.
Contribution
It introduces a new explicit formula for Abelian complexity specifically for infinite words related to quadratic Parry numbers.
Findings
Explicit formula for Abelian complexity derived
Enhanced understanding of combinatorial properties of these words
Potential applications in symbolic dynamics and number theory
Abstract
We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.