Geodesic
Fixed points and excedances in restricted permutations
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

Using an unprecedented technique involving diagonals of non-rational generating functions, we prove that among the permutations of length $n$ with $i$ fixed points and $j$ excedances, the number of 321-avoiding ones equals the number of 132-avoiding ones, for any given $i,j$. Our theorem generalizes a result of Robertson, Saracino and Zeilberger. Even though bijective proofs have later been found by the author jointly with Pak and with Deutsch, this paper contains the original analytic proof that was presented at FPSAC 2003.
DOI : 10.37236/2025
Classification : 05A15, 05A05, 30E20 
@article{10_37236_2025,
     author = {Sergi Elizalde},
     title = {Fixed points and excedances in restricted permutations},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {2},
     doi = {10.37236/2025},
     zbl = {1243.05018},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2025/}
}
TY  - JOUR
AU  - Sergi Elizalde
TI  - Fixed points and excedances in restricted permutations
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2025/
DO  - 10.37236/2025
ID  - 10_37236_2025
ER  - 
%0 Journal Article
%A Sergi Elizalde
%T Fixed points and excedances in restricted permutations
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/2025/
%R 10.37236/2025
%F 10_37236_2025
Sergi Elizalde. Fixed points and excedances in restricted permutations. The electronic journal of combinatorics, The Zeilberger Festschrift volume, Tome 18 (2011) no. 2. doi: 10.37236/2025

Cité par Sources :