Enumerating binary words restricted by subsequence frequency

Glenn Bruda

Let $p$ be a binary word of length $\ell$ with $r\ge 2$ runs. Previously known only for $k\le 4$, we show for $n$ sufficiently large that the number of binary words of length $n$ w…