Fixed points and excedances in restricted permutations
| dc.creator | Elizalde, Sergi | |
| dc.date | 2002-12-16 | |
| dc.date.accessioned | 2026-07-07T04:53:50Z | |
| dc.date.available | 2026-07-07T04:53:50Z | |
| dc.description | In this paper 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 all given i,j<=n. We use a new technique involving diagonals of non-rational generating functions. This theorem generalizes a recent result of Robertson, Saracino and Zeilberger, for which we also give another, more direct proof. | |
| dc.description | 12 pages, 10 figures, submitted to FPSAC'03 | |
| dc.identifier | https://arxiv.org/abs/math/0212221 | |
| dc.identifier | http://arxiv.org/abs/math/0212221 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/66009 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A15 | |
| dc.title | Fixed points and excedances in restricted permutations | |
| dc.type | text |