Exceedingly deranging !

Roberto Mantaci, Fanja Rakotondrajao

To appear at Formal Power Series and Algebraic Combinatorics (FPSAC01), Tempe, Arizona (USA), May 20-26, 2001


We study the distribution of exceedance over permutations with no fixed points (also called derangements) by giving a recursive formula for the number d__{n,k} of derangements over $n$ having $k$ eexceedances. We also give an exponential generating function for this distribution. We further refine this study by adding parity as additional parameter.

Server START Conference Manager
Update Time 23 Feb 2001 at 08:48:02
Maintainer maylis@labri.u-bordeaux.fr.
Start Conference Manager
Conference Systems