Geodesic
Words restricted by patterns with at most 2 distinct letters
The electronic journal of combinatorics, Permutation Patterns, Tome 9 (2002) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We find generating functions for the number of words avoiding certain patterns or sets of patterns with at most 2 distinct letters and determine which of them are equally avoided. We also find exact numbers of words avoiding certain patterns and provide bijective proofs for the resulting formulae.
DOI : 10.37236/1675
Classification : 05A05, 05A15
Mots-clés : generating functions, avoiding certain patterns, bijective proofs 
@article{10_37236_1675,
     author = {Alexander Burstein and Toufik Mansour},
     title = {Words restricted by patterns with at most 2 distinct letters},
     journal = {The electronic journal of combinatorics},
     year = {2002},
     volume = {9},
     number = {2},
     doi = {10.37236/1675},
     zbl = {1021.05002},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1675/}
}
TY  - JOUR
AU  - Alexander Burstein
AU  - Toufik Mansour
TI  - Words restricted by patterns with at most 2 distinct letters
JO  - The electronic journal of combinatorics
PY  - 2002
VL  - 9
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1675/
DO  - 10.37236/1675
ID  - 10_37236_1675
ER  - 
%0 Journal Article
%A Alexander Burstein
%A Toufik Mansour
%T Words restricted by patterns with at most 2 distinct letters
%J The electronic journal of combinatorics
%D 2002
%V 9
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/1675/
%R 10.37236/1675
%F 10_37236_1675
Alexander Burstein; Toufik Mansour. Words restricted by patterns with at most 2 distinct letters. The electronic journal of combinatorics, Permutation Patterns, Tome 9 (2002) no. 2. doi: 10.37236/1675

Cité par Sources :