The computational complexity of rules for the character table of \(S_n\).

DOI10.1016/j.jsc.2003.11.001zbMath1125.20302arXivmath/0309225OpenAlexW2023010579MaRDI QIDQ2643536

Dan Bernstein

Publication date: 24 August 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsHecke algebrasYoung tableauxMurnaghan-Nakayama rulecharacter tablesYoung diagramscomputational complexitiesKazhdan-Lusztig characters

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Combinatorial aspects of representation theory (05E10) Hecke algebras and their representations (20C08) Representations of finite symmetric groups (20C30)

Related Items (5)

On the number of \(\lambda\)-unimodal involutions ⋮ The number of steps in the Robinson-Schensted algorithm ⋮ Involutions and the Gelfand character ⋮ Generating weighted Hurwitz numbers ⋮ RTNI—A symbolic integrator for Haar-random tensor networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representations of Coxeter groups and Hecke algebras
• Maximal degrees for Young diagrams in the \((k,l)\) hook
• On hooks of Young diagrams
• A recursive rule for Kazhdan-Lusztig characters
• The Characters of the Symmetric Group

This page was built for publication: The computational complexity of rules for the character table of \(S_n\).