Balanced Fibonacci word rectangles
The infinite Fibonacci word 0100101001 . . . is perhaps the most famous Sturmian word. One of its basic properties is that it is balanced. That is, any two blocks of the same length have either the same sum or their sums are off by 1.In this talk we will consider “Fibonacci word rectangles", i.e., blocks in the corresponding Hankel matrix. Using the software Walnut, we will fully characterise the balanced rectangles. I will also describe the result in terms of distribution modulo 1. Joint work with Jeffrey Shallit.