Recursions for Excedance number in some permutations groups

arXivmath/0702452MaRDI QIDQ6478792FDOQ6478792

Robert Shwartz, David Garber, Eli Bagno, Toufik Mansour

Publication date: 15 February 2007

Abstract: The excedance number for S_n is known to have an Eulerian distribution. Nevertheless, the classical proof uses descents rather than excedances. We present a direct recursive proof which seems to be folklore and extend it to the colored permutation groups G_r,n. The generalized recursion yields some interesting connection to Stirling numbers of the second kind. We also show some logconcavity result concerning a variant of the excedance number. Finally, we show that the generating function of the excedance number defined on G_r,n is symmetric.

Mathematics Subject Classification ID

This page was built for publication: Recursions for Excedance number in some permutations groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6478792)