The Murnaghan–Nakayama rule computes an irreducible character on a permutation with a specified cycle of length by
Here the leg length is one less than the number of occupied rows, and iteration ends at the empty partition with character value one. Conjugating a partition twists its character by the sign character:
For a transposition, remove a rim domino and evaluate the remaining character at the identity of . The three possible remaining shapes have degrees by the hook formula. For the single removable horizontal domino leaves , giving one. For the only rim domino leaves , giving two. For the removable bottom-row domino leaves , giving one. For , a horizontal domino leaves and a vertical domino leaves ; their contributions are . The conjugate-partition identity gives the remaining three values with reversed sign.
The Hook-length formula is . Both requested columns are therefore
As a check, the squared degrees sum to . The transposition column above was obtained from rim-hook removal and conjugation, independently of permutation characters.
Use the question's indexing convention: is the multiplicity of the irreducible Specht module in the permutation module . In notation for semistandard-tableau Kostka numbers this is often written , with the indices reversed.
Let be the Young subgroup. The permutation character is
and counts the -tabloids fixed by . Equivalently it counts ordered partitions into labelled rows of the prescribed sizes, each row invariant under . Character inner products and Frobenius reciprocity give the purely character-theoretic computation
The characters of symmetric groups are real-valued, so no conjugation is needed in the displayed subgroup average.
For , the Young subgroup has two elements, the identity and one transposition. Thus , and part (a) gives
The resulting dimension is , the dimension of the permutation module.
The Young subgroup for is trivial. Hence is the regular representation of . The subgroup-average formula reduces to
This is the usual multiplicity of an irreducible representation in the regular representation.

Articles by others on the same topic (0)

There are currently no matching articles.