Balanced Fibonacci word rectangles, and beyond
Discrete Mathematics & Theoretical Computer Science · 16.04.2026 · vol. 28:2 (Combinatorics)
DOI: 10.46298/dmtcs.16955 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics & Theoretical Computer Science, online erschienen am 16.04.2026. Verfasst von Jeffrey Shallit und 1 weiteren Autor:innen.
Abstract (Originalsprache)
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.
Zitieren
APA
Shallit, J., & Vukusic, I. (2026). Balanced Fibonacci word rectangles, and beyond. Discrete Mathematics & Theoretical Computer Science, vol. 28:2(Combinatorics). https://doi.org/10.46298/dmtcs.16955
Vancouver
Shallit J, Vukusic I. Balanced Fibonacci word rectangles, and beyond. Discrete Mathematics & Theoretical Computer Science. 2026;vol. 28:2(Combinatorics). doi:10.46298/dmtcs.16955
BibTeX
@article{Shallit2026,
author = {Shallit, Jeffrey and Vukusic, Ingrid},
title = {Balanced Fibonacci word rectangles, and beyond},
journal = {Discrete Mathematics & Theoretical Computer Science},
year = {2026},
volume = {vol. 28:2},
number = {Combinatorics},
doi = {10.46298/dmtcs.16955}
}
EUVIMED