Recursions for the flag-excedance number in colored permutations groups
DOI10.1515/PUMA-2015-0005zbMATH Open1374.05031OpenAlexW2565344904MaRDI QIDQ2973207FDOQ2973207
Authors: Eli Bagno, David Garber, Toufik Mansour, Robert Shwartz
Publication date: 31 March 2017
Published in: Pure Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/puma-2015-0005
Recommendations
recursionpermutation statisticsflag-excedance numbercolored permutation groupStirling number of second kind
Exact enumeration problems, generating functions (05A15) Bell and Stirling numbers (11B73) Combinatorial identities, bijective combinatorics (05A19) Symmetric groups (20B30)
Cited In (6)
- The solution of the recurrence relationfn(t)=an(t) fn−1(t)−bn(t)(∂/∂t) fn−1(t)
- Statistics on the multi-colored permutation groups
- On the excedance number of colored permutation groups
- Title not available (Why is that?)
- A generalized Eulerian triangle from staircase tableaux and tree-like tableaux
- Excedances in classical and affine Weyl groups
This page was built for publication: Recursions for the flag-excedance number in colored permutations groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2973207)