Solution

ID: past-exam-of-the-lie-algebras-and-representation-theory-of-symmetric-groups-course-of-the-university-of-oxford/2008/b/6/a/solution

If the cycle partition contains a part , the Murnaghan–Nakayama rule is
A border strip is a connected skew Young diagram with no block; its height is its number of occupied rows minus one. The remaining boxes must be a partition diagram. The recursion starts with character one for the empty diagram at the empty cycle type, and an empty sum is zero. Repeated removal for all cycle lengths computes the character value.

New to topics? Read the docs here!