Fixed points and excedances in restricted permutations

Abstract

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.

12 pages, 10 figures, submitted to FPSAC'03

Cited by in corpus (1)

• q Statistics on $S_n$ and Pattern Avoidance