Geodesic
A note on antichains of words
The electronic journal of combinatorics, Tome 2 (1995)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We can compress the word 'banana' as $xyyz$, where $x =$ 'b', $y = $ 'an',$z = $ 'a'. We say that 'banana' encounters $yy$. Thus a 'coded' version of $yy$ shows up in 'banana'. The relation '$u$ encounters $w$' is transitive, and thus generates an order on words. We study antichains under this order. In particular we show that in this order there is an infinite antichain of binary words avoiding overlaps.
DOI : 10.37236/1215
Classification : 68R15
Mots-clés : infinite antichain of binary words 
@article{10_37236_1215,
     author = {James D. Currie},
     title = {A note on antichains of words},
     journal = {The electronic journal of combinatorics},
     year = {1995},
     volume = {2},
     doi = {10.37236/1215},
     zbl = {0851.68091},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1215/}
}
TY  - JOUR
AU  - James D. Currie
TI  - A note on antichains of words
JO  - The electronic journal of combinatorics
PY  - 1995
VL  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1215/
DO  - 10.37236/1215
ID  - 10_37236_1215
ER  - 
%0 Journal Article
%A James D. Currie
%T A note on antichains of words
%J The electronic journal of combinatorics
%D 1995
%V 2
%U http://geodesic.mathdoc.fr/articles/10.37236/1215/
%R 10.37236/1215
%F 10_37236_1215
James D. Currie. A note on antichains of words. The electronic journal of combinatorics, Tome 2 (1995). doi: 10.37236/1215

Cité par Sources :