The sum of all hook characters
Wildon's Weblog 2019-08-20
Given a partition of , let denote the irreducible character of the symmetric group canonically labelled by the partition . For example, is the trivial character, is the sign character, and is the irreducible -degree constituent of the natural permutation character . Thus and for . Let be the sum of all the characters labelled by hook partitions. Let be the set of permutations in having only cycles of odd length.
A nice short paper by Jay Taylor uses characters of the symmetric group labelled by skew partitions to prove that
where is the number of cycles in .
As Taylor notes, this result is a special case of a more general theorem of Regev, proved by him using Lie superalgebras. Taylor’s paper gives a short proof using skew characters of the symmetric group. The purpose of this post is to give an alternative proof, using only a basic result on exterior powers of the natural permutation character and to suggest some generalizations not contained in Regev’s original results.
Background: a generating function for exterior powers.
Let denote the th exterior power of a character or representation. Let be a complex representation of a finite group with character and let have eigenvalues in its action on . Thus . Let be a basis for in which acts diagonally. Then
and we see that
This is the -th elementary symmetric polynomial evaluated at the eigenvalues . Hence
This generating function is the counterpart for exterior powers of the Molien series, defined using symmetric powers, that is fundamental to invariant theory.
Background: exterior powers of the natural module.
Let be the natural representation of over the complex numbers. Now is the sign representation of , and correspondingly, . More generally, is the monomial representation of induced from . Its character is known to be
for . This decomposition is an immediate corollary of either the Young or Pieri rules. It may also be proved using Specht modules and an explicit isomorphism : see for instance Section 5 of this paper with Giannelli and Lim.
Proof.
By (2) we have
Hence the coefficient of in is if is odd, and if is even. For example,
Thus , where the sum is over all such that is odd.
This sum is related to (1). Let have precisely cycles of length , for each . The eigenvalues of the permutation matrix representing can be found by considering the cycles separately: each -cycle contributes eigenvalues , where is a primitive th root of unity. Since , the generating function in (1) gives
Denote this polynomial by . We now have
Since
and for all , the result follows.
Possible generalizations.
Let where the sum is over all not congruent to modulo . Then by (2), , and the proof above suggests that may also have a fairly simple form. One might also look for analogous identities replacing with the permutation character of acting on the -subsets of .