A Problem From The 2005 Putnam Competition
A link to the Putnam competition website appears in the section External links. The problem asks for a proof that
where the sum is over all permutations of, is the sign of, i.e. if is even and if is odd, and is the number of fixed points of .
Now the sign of is given by
where the product is over all cycles c of, as explained e.g. on the page on even and odd permutations.
Hence we consider the combinatorial class
where marks one minus the length of a contributing cycle, and marks fixed points. Translating to generating functions, we obtain
or
Now we have
and hence the desired quantity is given by
Doing the computation, we obtain
or
Extracting coefficients, we find that the coefficient of is zero. The constant is one, which does not agree with the formula (should be zero). For positive, however, we obtain
or
which is the desired result.
As an interesting aside, we observe that may be used to evaluate the following determinant of an matrix:
where . Recall the formula for the determinant:
Now the value of the product on the right for a permutation is, where f is the number of fixed points of . Hence
which yields
and finally
Read more about this topic: Random Permutation Statistics
Famous quotes containing the words problem, putnam and/or competition:
“War is not a life: it is a situation,
One which may neither be ignored nor accepted,
A problem to be met with ambush and stratagem,
Enveloped or scattered.”
—T.S. (Thomas Stearns)
“Cut the pie any way you like, meanings just aint in the head!”
—Hilary Putnam (b. 1926)
“Wearing overalls on weekdays, painting somebody elses house to earn money? Youre working class. Wearing overalls at weekends, painting your own house to save money? Youre middle class.”
—Lawrence Sutton, British prizewinner in competition in Sunday Correspondent (London)