A note on a recursion for the number of derangements
From MaRDI portal
Publication:798657
DOI10.1016/S0195-6698(83)80034-1zbMATH Open0547.05007OpenAlexW2058395674MaRDI QIDQ798657FDOQ798657
Publication date: 1983
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(83)80034-1
Recommendations
Cites Work
Cited In (16)
- An Unusual Recursive Formula to Answer a Question Regarding Fixed Points in Permutations
- Derangements and Euler's difference table for \(C_{l} \wr S_{n}\)
- Bijectively deranging!
- Some identities involving derangement polynomials and numbers and moments of gamma random variables
- A recovery of two determinantal representations for derangement numbers
- Permutations by number of fixed points and anti-excedances
- Exceedingly deranging!
- Bijections for restricted inversion sequences and permutations with fixed points
- Descent classes of permutations with a given number of fixed points
- On a generalization of the recurrence defining the number of derangements
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An involution on derangements preserving excedances and right-to-left minima
- A \(p,q\)-analogue of the generalized derangement numbers
- Title not available (Why is that?)
This page was built for publication: A note on a recursion for the number of derangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798657)