A Short Combinatorial Proof of Derangement Identity
classification
🧮 math.CO
keywords
derangementcombinatorialfixednumberproofshortexactlyhaving
read the original abstract
The $n$-th rencontres number with the parameter $r$ is the number of permutations having exactly $r$ fixed points. In particular, a derangement is a permutation without any fixed point. We presents a short combinatorial proof for a weighted sum derangement identities.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.