A note on a recursion for the number of derangements

DOI10.1016/S0195-6698(83)80034-1zbMath0547.05007OpenAlexW2058395674MaRDI QIDQ798657

Jeffery B. Remmel

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

zbMATH Keywords

permutationsbijective proofderangements

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items

Bijections for restricted inversion sequences and permutations with fixed points, Permutations by number of fixed points and anti-excedances, Exceedingly deranging!, Unnamed Item, Some identities involving derangement polynomials and numbers and moments of gamma random variables, A \(p,q\)-analogue of the generalized derangement numbers, Unnamed Item, Descent classes of permutations with a given number of fixed points, Bijectively deranging!

Cites Work

• A combinatorial interpretation of q-derangement and q-Laguerre numbers