Geodesic
Lengths of irreducible and delicate words
Benjamin Przybocki1
1Stanford University
The electronic journal of combinatorics, Tome 29 (2022) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We study words that barely avoid repetitions, for several senses of "barely". A squarefree (respectively, overlap-free, cubefree) word is irreducible if removing any one of its interior letters creates a square (respectively, overlap, cube). A squarefree (respectively, overlap-free, cubefree) word is delicate if changing any one of its letters creates a square (respectively, overlap, cube). We classify the lengths of irreducible and delicate squarefree, overlap-free, and cubefree words over binary and ternary alphabets.
DOI : 10.37236/10669
Classification : 68R15
Mots-clés : repetitions, irreducible words, delicate words, extremal words, pattern avoidance

Benjamin Przybocki  1

1 Stanford University 
@article{10_37236_10669,
     author = {Benjamin Przybocki},
     title = {Lengths of irreducible and delicate words},
     journal = {The electronic journal of combinatorics},
     year = {2022},
     volume = {29},
     number = {3},
     doi = {10.37236/10669},
     zbl = {1508.68275},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/10669/}
}
TY  - JOUR
AU  - Benjamin Przybocki
TI  - Lengths of irreducible and delicate words
JO  - The electronic journal of combinatorics
PY  - 2022
VL  - 29
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/10669/
DO  - 10.37236/10669
ID  - 10_37236_10669
ER  - 
%0 Journal Article
%A Benjamin Przybocki
%T Lengths of irreducible and delicate words
%J The electronic journal of combinatorics
%D 2022
%V 29
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/10669/
%R 10.37236/10669
%F 10_37236_10669
Benjamin Przybocki. Lengths of irreducible and delicate words. The electronic journal of combinatorics, Tome 29 (2022) no. 3. doi: 10.37236/10669

Cité par Sources :