A Short Combinatorial Proof of Derangement Identity
Combinatorics
2017-11-15 v1
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.
Cite
@article{arxiv.1711.04537,
title = {A Short Combinatorial Proof of Derangement Identity},
author = {Ivica Martinjak and Dajana Stanić},
journal= {arXiv preprint arXiv:1711.04537},
year = {2017}
}
Comments
5 pages, 1 figure