The number of positions starting a square in binary words
The electronic journal of combinatorics, Tome 18 (2011) no. 1
We consider the number $\sigma(w)$ of positions that do not start a square in binary words $w$. Letting $\sigma(n)$ denote the maximum of $\sigma(w)$ for length $|w|=n$, we show that $\lim \sigma(n)/n = 15/31$.
@article{10_37236_493,
author = {Tero Harju and Tomi K\"arki and Dirk Nowotka},
title = {The number of positions starting a square in binary words},
journal = {The electronic journal of combinatorics},
year = {2011},
volume = {18},
number = {1},
doi = {10.37236/493},
zbl = {1209.68398},
url = {http://geodesic.mathdoc.fr/articles/10.37236/493/}
}
Tero Harju; Tomi Kärki; Dirk Nowotka. The number of positions starting a square in binary words. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/493
Cité par Sources :