A note on a recursion for the number of derangements

DOI10.1016/S0195-6698(83)80034-1zbMATH Open0547.05007OpenAlexW2058395674MaRDI QIDQ798657FDOQ798657

Authors: Jeffrey 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

Recommendations

• A simple bijective proof of a familiar derangement recurrence
• scientific article; zbMATH DE number 6985711
• On the combinatorics of derangements and related permutations
• A Bijection in the Theory of Derangements
• Another interpretation of the number of derangements

zbMATH Keywords

permutationsderangementsbijective proof

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (21)

• An Unusual Recursive Formula to Answer a Question Regarding Fixed Points in Permutations
• Recounting the Odds of an Even Derangement
• The number of graph homomorphisms between paths and cycles with loops, a problem from Stanley's enumerative combinatorics
• 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!
• Bijective proofs of formulas with \((-1)^n\)
• 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
• Counting the 2-disarrangements of \(2n\) numbers
• Some recursion formulae for the number of derangements and Bell numbers
• Title not available (Why is that?)
• A simple bijective proof of a familiar derangement recurrence
• Title not available (Why is that?)
• A bijection for the Boolean numbers of Ferrers graphs
• An involution on derangements preserving excedances and right-to-left minima
• A \(p,q\)-analogue of the generalized derangement numbers

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)