论文标题
熟悉的危险复发的简单徒证明
A simple bijective proof of a familiar derangement recurrence
论文作者
论文摘要
众所周知，D_N $ d_n $的漏洞数量$ d_n $，该$ n $没有固定点，满足复发$ d_n = nd_ {n-1}+（-1）^n $ for $ n \ ge1 $。 Remmel，Wilf，Désarménien和Benjamin-ornstein给出了该公式的组合证明。在这里，我们介绍了另一个更简单的公文证明。
It is well known that the derangement numbers $d_n$, which count permutations of length $n$ with no fixed points, satisfy the recurrence $d_n=nd_{n-1}+(-1)^n$ for $n\ge1$. Combinatorial proofs of this formula have been given by Remmel, Wilf, Désarménien and Benjamin--Ornstein. Here we present yet another, arguably simpler, bijective proof.
