A Short Combinatorial Proof of Derangement Identity
arXiv:1711.04537
Abstract
The -th rencontres number with the parameter is the number of permutations having exactly 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.
5 pages, 1 figure