A proof of the Murnaghan-Nakayama rule using Specht modules and tableau combinatorics

DOI10.1007/S00026-019-00486-ZzbMATH Open1477.20025arXiv1805.00255OpenAlexW3007384108MaRDI QIDQ2307697FDOQ2307697

Authors: Jasdeep Kochhar, Mark Wildon 

Publication date: 25 March 2020

Published in: Annals of Combinatorics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1805.00255

Recommendations

• A combinatorial proof of a plethystic Murnaghan-Nakayama rule
• Two Murnaghan-Nakayama rules in Schubert calculus
• The combinatorics of rim hook tableaux
• The loop Murnaghan-Nakayama rule
• A \(q\)-rational Murnaghan-Nakayama rule

zbMATH Keywords

Specht moduletracesMurnaghan-Nakayama rulepolytabloids

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Group actions on combinatorial structures (05E18) Representations of finite symmetric groups (20C30) Combinatorial aspects of groups and algebras (05E16)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The representation theory of the symmetric groups
• Title not available (Why is that?)
• Bijective combinatorics
• Title not available (Why is that?)
• Vertices of Specht modules and blocks of the symmetric group.
• On the Representations of the Symmetric Group
• Specht series for skew representations of symmetric groups
• Counting with symmetric functions
• Group characters and algebra
• On the representation theory of the symmetric groups

Cited In (7)

• A rational-function identity related to the Murnaghan-Nakayama formula for the characters of \(S_ n\)
• Stability of Kronecker products of irreducible characters of the symmetric group
• A refinement of the Murnaghan-Nakayama rule by descents for border strip tableaux
• A refinement of the Murnaghan-Nakayama rule by descents for border strip tableaux
• A combinatorial proof of a plethystic Murnaghan-Nakayama rule
• The computational complexity of rules for the character table of \(S_n\).
• A \(q\)-rational Murnaghan-Nakayama rule

This page was built for publication: A proof of the Murnaghan-Nakayama rule using Specht modules and tableau combinatorics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2307697)