arXiv · 2509.25994
Balanced Fibonacci word rectangles, and beyond
Abstract
Following a recent paper of Anselmo et al., we consider $m \times n$ rectangular matrices formed from the Fibonacci word, and we show that their balance properties can be solved with a finite automaton. We also generalize the result to every Sturmian characteristic word corresponding to a quadratic irrational. Finally, we also examine the analogous question for the Tribonacci word and the Thue-Morse word.
Explore related subjects
Keep this discovery
Jeffrey Shallit, Ingrid Vukusic. 2025-09-30. Balanced Fibonacci word rectangles, and beyond. https://doi.org/10.46298/dmtcs.16955
Cite the original work for its findings. Save a collection to share your selection of sources.