Permutations by number of fixed points and anti-excedances
From MaRDI portal
Publication:1929716
DOI10.1007/S13370-011-0025-YzbMATH Open1253.05019OpenAlexW2020273985MaRDI QIDQ1929716FDOQ1929716
Publication date: 9 January 2013
Published in: Afrika Matematika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13370-011-0025-y
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Symmetric groups (20B30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Théorie géométrique des polynômes eulériens
- Exceedingly deranging!
- Binomial coefficients and anti-exceedances of even permutations: A combinatorial proof
- A permutations representation that knows what ``Eulerian means
- A note on a recursion for the number of derangements
- On the anti-exceedance distribution on the symmetric group and its subgroups
- A Bijection in the Theory of Derangements
Cited In (10)
- An Unusual Recursive Formula to Answer a Question Regarding Fixed Points in Permutations
- Permutations Fixing ak-set
- Permutations depending on the exceedance type and the number of inversions and combinatorial interpretation of a continued fraction of Heine
- Title not available (Why is that?)
- Excedance numbers for the permutations of type \(B\)
- Symmetric functions, generalized blocks, and permutations with restricted cycle structure
- Title not available (Why is that?)
- The largest and the smallest fixed points of permutations
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Permutations by number of fixed points and anti-excedances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1929716)