Algorithmically distinguishing irreducible characters of the symmetric group

DOI10.37236/9753zbMath1473.20022arXiv2006.00035OpenAlexW3155040500MaRDI QIDQ2662346

Jennifer Paulhus, Timothy Y. Chow

Publication date: 12 April 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

charactersymmetric groupMurnaghan-Nakayama rule

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Representations of finite symmetric groups (20C30)

Related Items (1)

A Combinatorial Proof of a Symmetric Group Character Involution

Cites Work

• Unnamed Item
• Unnamed Item
• Characters of symmetric groups: sharp bounds and applications.
• Hook formulas for skew shapes. I: \(q\)-analogues and bijections
• On the complexity of computing Kronecker coefficients
• Symmetric group character degrees and hook numbers

This page was built for publication: Algorithmically distinguishing irreducible characters of the symmetric group