The computational complexity of rules for the character table of \(S_n\). (Q2643536): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2023010579 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: math/0309225 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4938469 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On hooks of Young diagrams / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Representations of Coxeter groups and Hecke algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Characters of the Symmetric Group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5840165 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4299617 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximal degrees for Young diagrams in the \((k,l)\) hook / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A recursive rule for Kazhdan-Lusztig characters / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4001520 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3748279 / rank | |||
Normal rank |
Revision as of 13:13, 26 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The computational complexity of rules for the character table of \(S_n\). |
scientific article |
Statements
The computational complexity of rules for the character table of \(S_n\). (English)
0 references
24 August 2007
0 references
Murnaghan-Nakayama rule
0 references
character tables
0 references
Kazhdan-Lusztig characters
0 references
Hecke algebras
0 references
algorithms
0 references
computational complexities
0 references
Young diagrams
0 references
Young tableaux
0 references