Recursions for Excedance number in some permutations groups
| dc.creator | Bagno, Eli | |
| dc.creator | Garber, David | |
| dc.creator | Mansour, Toufik | |
| dc.creator | Shwartz, Robert | |
| dc.date | 2007-02-15 | |
| dc.date | 2008-06-03 | |
| dc.date.accessioned | 2026-07-07T09:42:17Z | |
| dc.date.available | 2026-07-07T09:42:17Z | |
| dc.description | 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. | |
| dc.description | 14 pages, no figures; revised version with new results | |
| dc.identifier | https://arxiv.org/abs/math/0702452 | |
| dc.identifier | http://arxiv.org/abs/math/0702452 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/162127 | |
| dc.subject | Combinatorics | |
| dc.subject | Group Theory | |
| dc.subject | 05E15 | |
| dc.title | Recursions for Excedance number in some permutations groups | |
| dc.type | text |