Recursions for Excedance number in some permutations groups

Details Recursions for Excedance number in some permutations groups Recursions for Excedance number in some permutations groups

2007-02-15

arxiv.org/abs/math/0702452v2

Mathematics

Combinatorics

14 pages, no figures; revised version with new results

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Recursions for Excedance number in some permutations groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Recursions for Excedance number in some permutations groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Recursions for Excedance number in some permutations groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-302869