Geodesic
Permutations avoiding two patterns of length three
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 study permutations that avoid two distinct patterns of length three and any additional set of patterns. We begin by showing how to enumerate these permutations using generating trees, generalizing the work of Mansour [13]. We then find sufficient conditions for when the number of such permutations is given by a polynomial and answer a question of Egge [6]. Afterwards, we show how to use these computations to count permutations that avoid two distinct patterns of length three and contain other patterns a prescribed number of times.
DOI : 10.37236/1678
Classification : 05A15, 05A05, 68R15
Mots-clés : restricted permutation, forbidden subsequence, generating tree 
@article{10_37236_1678,
     author = {Vincent R. Vatter},
     title = {Permutations avoiding two patterns of length three},
     journal = {The electronic journal of combinatorics},
     year = {2002},
     volume = {9},
     number = {2},
     doi = {10.37236/1678},
     zbl = {1024.05005},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1678/}
}
TY  - JOUR
AU  - Vincent R. Vatter
TI  - Permutations avoiding two patterns of length three
JO  - The electronic journal of combinatorics
PY  - 2002
VL  - 9
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1678/
DO  - 10.37236/1678
ID  - 10_37236_1678
ER  - 
%0 Journal Article
%A Vincent R. Vatter
%T Permutations avoiding two patterns of length three
%J The electronic journal of combinatorics
%D 2002
%V 9
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/1678/
%R 10.37236/1678
%F 10_37236_1678
Vincent R. Vatter. Permutations avoiding two patterns of length three. The electronic journal of combinatorics, Permutation Patterns, Tome 9 (2002) no. 2. doi: 10.37236/1678

Cité par Sources :