Past exam of the mathematics course of the University of Cambridge / 2022 / iii / Paper 160 / 2 / c

If $\mathrm{sgn}(\mu )=-1$, then the cycle type $\mu$ contains an odd number of even parts and in particular contains an even part, so the hypothesis gives ${\chi }^{\lambda }(\mu )=0$. If $\mathrm{sgn}(\mu )=1$, multiplication by the sign changes nothing. Henceby part b(iii). Distinct partitions label distinct complex irreducible characters, so $\lambda ={\lambda }^{\prime }$.

Because $\lambda$ is self-conjugate, every off-diagonal hook of even length is paired with its transpose, while every diagonal hook has odd length. Suppose even hooks exist and let $L$ be their maximum length. Apply the Murnaghan–Nakayama rule to cycle types beginning with $L$ and complete the remaining cycle type with the principal hooks of the residual diagram. The principal-hook character value of a symmetric group makes each surviving residual character equal to $1$ or $-1$.

The assumed vanishing forces cancellation among the removable $L$-hooks. The standard maximal-hook comparison shows that the only possible cancellation is one transposed pair: the hooks must be $H_{1,j}$ and $H_{j,1}$ for a single $j>1$. Any further hook of length $L$, or a maximal hook with both indices greater than one, can be isolated by the residual principal-hook cycle type and would give a nonzero value. Thus either there are no even hooks or the maximum even length occurs exactly at that pair.

For a self-conjugate diagram, compare successive row lengths along the boundary. If every difference is one, the diagram is a staircase. Otherwise the first horizontal or vertical repetition creates an even hook. Following the boundary to the last such repetition creates either a second transposed pair of the same maximal even length or a maximal even hook away from the first row and column. Both alternatives contradict part ii. Therefore every successive row length decreases by one andTogether with part b(ii), this proves the staircase-character vanishing criterion.