Félix Balado, Guénolé C. M. Silvestre·2023-02-23·via math.CO updates on arXiv.org
We give three different computations of the total number of runs of length $i$ in binary $n$-strings, and we discuss the connection of this problem with the compositions of $n$.