Geodesic
How many square occurrences must a binary sequence contain?
The electronic journal of combinatorics, Tome 10 (2003)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
Every binary word with at least four letters contains a square. A. Fraenkel and J. Simpson showed that three distinct squares are necessary and sufficient to construct an infinite binary word. We study the following complementary question: how many square occurrences must a binary word contain? We show that this quantity is, in the limit, a constant fraction of the word length, and prove that this constant is $0.55080...$.
DOI : 10.37236/1705
Classification : 05A15, 68R15 
Gregory Kucherov; Pascal Ochem; Michaël Rao. How many square occurrences must a binary sequence contain?. The electronic journal of combinatorics, Tome 10 (2003). doi: 10.37236/1705
@article{10_37236_1705,
     author = {Gregory Kucherov and Pascal Ochem and Micha\"el Rao},
     title = {How many square occurrences must a binary sequence contain?},
     journal = {The electronic journal of combinatorics},
     year = {2003},
     volume = {10},
     doi = {10.37236/1705},
     zbl = {1011.05007},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1705/}
}
TY  - JOUR
AU  - Gregory Kucherov
AU  - Pascal Ochem
AU  - Michaël Rao
TI  - How many square occurrences must a binary sequence contain?
JO  - The electronic journal of combinatorics
PY  - 2003
VL  - 10
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1705/
DO  - 10.37236/1705
ID  - 10_37236_1705
ER  - 
%0 Journal Article
%A Gregory Kucherov
%A Pascal Ochem
%A Michaël Rao
%T How many square occurrences must a binary sequence contain?
%J The electronic journal of combinatorics
%D 2003
%V 10
%U http://geodesic.mathdoc.fr/articles/10.37236/1705/
%R 10.37236/1705
%F 10_37236_1705

Cité par Sources :