Number of permutations with a specified number of fixed points - MathOverflow

Number of permutations with a specified number of fixed points

2009-12-21T16:24:04Z

Let F(k,n) be the number of permutations of an n-element set that keep k elements fixed.

We know:

F(n,n) = 1
F(n-1,n) = 0
F(n-2,n) = $\binom {n} {2}$

...
F(0,n) = n! $\cdot \sum_{k=0}^n \frac {(-1)^k}{k!}$ (the subfactorial)

The summation formula is obviously

$\displaystyle\sum_{k=0}^n F(k,n) = n!$

A recursive definition of F(k,n) is (my claim):

$F(k,n) = \binom {n} {k} \cdot ( k! - \displaystyle\sum_{i=0}^{k-1} F(i,k) )$

Question 1: Is there a common name for the "generalized factorial" F(k,n)?

Question 2: Does anyone know a closed form for F(k,n) or have an idea how to get it from the recursive definition? (generating function?)

Answer by Michael Lugo for Number of permutations with a specified number of fixed points

2009-12-21T16:31:20Z

The "semi-exponential" generating function for these is

$\sum_{n=0}^\infty \sum_{k=0}^n {F(k,n) z^n u^k \over n!} = {\exp((u-1)z) \over 1-z}$

which follows from the exponential formula.

These numbers are apparently called the rencontres numbers although I'm not sure how standard that name is.

Now, how do we get a formula for these numbers out of this? First note that

$$exp((u-1)z) = 1 + (u-1)z + {(u-1)^2 \over 2!} z^2 + {(u-1)^3 \over 3!} z^3 + \cdots $$

and therefore the "coefficient" (actually a polynomial in $u$) of $z^n$ in $exp((u-1)z)/(1-z)$ is

$$ P_n(u) = 1 + (u-1) + {(u-1)^2 \over 2!} + \cdots + {(u-1)^n \over n!} = \sum_{j=0}^n {{(u-1)^j } \over j!} $$

since division of a generating function by $1-z$ has the effect of taking partial sums of the coefficients.

The coefficient of $u^k$ in $P_n(u)$ (which I'll denote $[u^k] P_n(u)$, where $[u^k]$ denotes taking the $u^k$-coefficient) is then

$$ [u^k] P_n(u) = \sum_{j=0}^n [u^k] {(u-1)^j \over j!} $$

But we only need to do the sum for $j = k, \ldots, n$; the lower terms are zero, since they are the $u^k$-coefficient of a polynomial of degree less than $k$. So

$$ [u^k] P_n(u) = \sum_{j=k}^n [u^k] {(u-1)^j \over j!} $$

and by the binomial theorem,

$$ [u^k] P_n(u) = \sum_{j=k}^n {(-1)^{j-k} \over k! (j-k)!} $$

Finally, $F(k,n) = n! [u^k] P_n(u)$, and so we have

$$ F(k,n) = n! \sum_{j=k}^n {(-1)^{j-k} \over k!(j-k)!} $$

Answer by Reid Barton for Number of permutations with a specified number of fixed points

2009-12-21T17:09:07Z

A permutation of {1, ..., n} with k fixed points is determined by choosing which k elements of {1, ..., n} it fixes and choosing a derangement of the remaining n-k elements. So,

$F(k, n) = {n \choose k} F(0, n-k)$.

(This formula is also on the page Michael Lugo linked to.) You have already given one formula for the number of derangements on n letters. Another one is F(0, n) = the nearest integer to n!/e.

Answer by Hans Stricker for Number of permutations with a specified number of fixed points

2010-02-16T00:54:18Z

see Subfactorial or rencontres numbers, or derangements: number of permutations of n elements with no fixed points