Fixed points and excedances in restricted permutations (Q665764)

Summary: 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 \textit{A. Robertson}, \textit{D. Saracino} and \textit{D. Zeilberger} [Ann. Comb. 6, No.3--4, 427--444 (2002; Zbl 1017.05014)]. Even though bijective proofs have later been found by the author jointly with \textit{I. Pak} [J. Comb. Theory, Ser. A 105, No. 2, 207--219 (2004; Zbl 1048.05003)] and with \textit{E. Deutsch} [Ann. Comb. 7, No. 3, 281-297 (2003; Zbl 1047.05001)], this paper contains the original analytic proof that was presented at FPSAC 2003.