An analogue of the Thue-Morse sequence (Q2372874)

Consider the finite binary words \(T(n)\), \(n \in \mathbb{N}\), defined by the self-similar process \(T(0):=0\) and \(T(n+1):=T(n) \cdot \overline{T(n)}\), where the dot \(\cdot\) denotes word concatenation and \(\bar{w}\) the word obtained from \(w\) by exchanging the \(0\)'s and the \(1\)'s. The limiting word of this process is \(T(\infty)=01101001\ldots\), and denoting by \(t(n)\) the \(n\)th bit of this word we obtain the well-known Thue-Morse sequence. \textit{R. Bacher} and \textit{R. Chapman} [Eur. J. Comb. 25, No. 4, 459--473 (2004; Zbl 1055.15028)] showed how \(t\) appears in the context of LDU decomposition of self-similar matrices where it gets related to a semi-infinite self-similar ``Sierpiński matrix.'' In this very well-written paper, the author considers an analogue of the Thue-Morse sequence. More precisely, he considers the finite binary words \(Z(n)\), \(n \in \mathbb{N}\), defined by \(Z(0):=0\), \(Z(1):=01\) and \(Z(n+1):=Z(n) \cdot \overline{Z(n-1)}\). Denoting by \(Z(\infty)=01110100\ldots\) the limiting word, and by \(z(n)\) the \(n\)th bit of this word, the author shows that the above mentioned theorem of Bacher and Chapman has a natural analogue involving \(z\). Indeed, \(z\) gets related to a ``zeta matrix'' which turns out to be the exponential of the incidence matrix of the Hasse diagram of the poset of finite subsets of \(\mathbb{N}\) without two consecutive elements, ordered by inclusion.