Geodesic
A short proof for the number of permutations containing pattern 321 exactly once
The electronic journal of combinatorics, The Zeilberger Festschrift volume, Tome 18 (2011) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We give a short proof for J. Noonan's result on the number of permutations containing pattern 321 exactly once.
DOI : 10.37236/2017
Classification : 05A05, 05A15 
@article{10_37236_2017,
     author = {Alexander Burstein},
     title = {A short proof for the number of permutations containing pattern 321 exactly once},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {2},
     doi = {10.37236/2017},
     zbl = {1229.05006},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2017/}
}
TY  - JOUR
AU  - Alexander Burstein
TI  - A short proof for the number of permutations containing pattern 321 exactly once
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2017/
DO  - 10.37236/2017
ID  - 10_37236_2017
ER  - 
%0 Journal Article
%A Alexander Burstein
%T A short proof for the number of permutations containing pattern 321 exactly once
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/2017/
%R 10.37236/2017
%F 10_37236_2017
Alexander Burstein. A short proof for the number of permutations containing pattern 321 exactly once. The electronic journal of combinatorics, The Zeilberger Festschrift volume, Tome 18 (2011) no. 2. doi: 10.37236/2017

Cité par Sources :