Geodesic
A note on the number of squares in a partial word with one hole
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 43 (2009) no. 4, pp. 767-774.

Voir la notice de l'article provenant de la source Numdam

A well known result of Fraenkel and Simpson states that the number of distinct squares in a word of length n is bounded by 2n since at each position there are at most two distinct squares whose last occurrence starts. In this paper, we investigate squares in partial words with one hole, or sequences over a finite alphabet that have a “do not know” symbol or “hole”. A square in a partial word over a given alphabet has the form uv where u is compatible with v, and consequently, such square is compatible with a number of words over the alphabet that are squares. Recently, it was shown that for partial words with one hole, there may be more than two squares that have their last occurrence starting at the same position. Here, we prove that if such is the case, then the length of the shortest square is at most half the length of the third shortest square. As a result, we show that the number of distinct squares compatible with factors of a partial word with one hole of length n is bounded by 7n2.

DOI : 10.1051/ita/2009019
Classification : 68R15, 05A05
Mots-clés : combinatorics on words, partial words, squares 
@article{ITA_2009__43_4_767_0,
     author = {Blanchet-Sadri, Francine and Merca\c{s}, Robert},
     title = {A note on the number of squares in a partial word with one hole},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {767--774},
     publisher = {EDP-Sciences},
     volume = {43},
     number = {4},
     year = {2009},
     doi = {10.1051/ita/2009019},
     mrnumber = {2589991},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/articles/10.1051/ita/2009019/}
}
TY  - JOUR
AU  - Blanchet-Sadri, Francine
AU  - Mercaş, Robert
TI  - A note on the number of squares in a partial word with one hole
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2009
SP  - 767
EP  - 774
VL  - 43
IS  - 4
PB  - EDP-Sciences
UR  - https://geodesic-test.mathdoc.fr/articles/10.1051/ita/2009019/
DO  - 10.1051/ita/2009019
LA  - en
ID  - ITA_2009__43_4_767_0
ER  - 
%0 Journal Article
%A Blanchet-Sadri, Francine
%A Mercaş, Robert
%T A note on the number of squares in a partial word with one hole
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2009
%P 767-774
%V 43
%N 4
%I EDP-Sciences
%U https://geodesic-test.mathdoc.fr/articles/10.1051/ita/2009019/
%R 10.1051/ita/2009019
%G en
%F ITA_2009__43_4_767_0
Blanchet-Sadri, Francine; Mercaş, Robert. A note on the number of squares in a partial word with one hole. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 43 (2009) no. 4, pp. 767-774. doi : 10.1051/ita/2009019. https://geodesic-test.mathdoc.fr/articles/10.1051/ita/2009019/

[1] J. Berstel and L. Boasson, Partial words and a theorem of Fine and Wilf. Theoret. Comput. Sci. 218 (1999) 135-141. | Zbl | MR

[2] F. Blanchet-Sadri, Algorithmic Combinatorics on Partial Words. Chapman & Hall/CRC Press, Boca Raton, FL (2008). | MR

[3] F. Blanchet-Sadri and D.K. Luhmann, Conjugacy on partial words. Theoret. Comput. Sci. 289 (2002) 297-312. | Zbl | MR

[4] F. Blanchet-Sadri, R. Mercaş and G. Scott, Counting distinct squares in partial words, edited by E. Csuhaj-Varju, Z. Esik, AFL 2008, 12th International Conference on Automata and Formal Languages, Balatonfüred, Hungary (2008) 122-133, www.uncg.edu/cmp/research/freeness | MR

[5] F. Blanchet-Sadri, D.D. Blair and R.V. Lewis, Equations on partial words. RAIRO-Theor. Inf. Appl. 43 (2009) 23-39, www.uncg.edu/cmp/research/equations | Zbl | MR | mathdoc-id

[6] A.S. Fraenkel and J. Simpson, How many squares can a string contain? J. Combin. Theory Ser. A 82 (1998) 112-120. | Zbl | MR

[7] L. Ilie, A simple proof that a word of length n has at most 2n distinct squares. J. Combin. Theory Ser. A 112 (2005) 163-164. | Zbl | MR

[8] L. Ilie, A note on the number of squares in a word. Theoret. Comput. Sci. 380 (2007) 373-376. | Zbl | MR

Cité par Sources :