2000 character limit reached
A proof of the Murnaghan--Nakayama rule using Specht modules and tableau combinatorics (1805.00255v2)
Published 1 May 2018 in math.RT and math.CO
Abstract: The Murnaghan--Nakayama rule is a combinatorial rule for the character values of symmetric groups. We give a new combinatorial proof by explicitly finding the trace of the representing matrices in the standard basis of Specht modules. This gives an essentially bijective proof of the rule. A key lemma is an extension of a straightening result proved by the second author to skew-tableaux. Our module theoretic methods also give short proofs of Pieri's rule and Young's rule.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.