Geodesic
Counting 1324-avoiding permutations
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 consider permutations that avoid the pattern 1324. By studying the generating tree for such permutations, we obtain a recurrence formula for their number. A computer program provides data for the number of 1324-avoiding permutations of length up to 20.
DOI : 10.37236/1685
Classification : 05A15, 05A05 
@article{10_37236_1685,
     author = {Darko Marinov and Rado\v{s} Radoi\v{c}i\'c},
     title = {Counting 1324-avoiding permutations},
     journal = {The electronic journal of combinatorics},
     year = {2002},
     volume = {9},
     number = {2},
     doi = {10.37236/1685},
     zbl = {1023.05009},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1685/}
}
TY  - JOUR
AU  - Darko Marinov
AU  - Radoš Radoičić
TI  - Counting 1324-avoiding permutations
JO  - The electronic journal of combinatorics
PY  - 2002
VL  - 9
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1685/
DO  - 10.37236/1685
ID  - 10_37236_1685
ER  - 
%0 Journal Article
%A Darko Marinov
%A Radoš Radoičić
%T Counting 1324-avoiding permutations
%J The electronic journal of combinatorics
%D 2002
%V 9
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/1685/
%R 10.37236/1685
%F 10_37236_1685
Darko Marinov; Radoš Radoičić. Counting 1324-avoiding permutations. The electronic journal of combinatorics, Permutation Patterns, Tome 9 (2002) no. 2. doi: 10.37236/1685

Cité par Sources :