Horizontal partitions and Kleshchev's algorithm

DOI10.1017/S0305004100074661MaRDI QIDQ4885208zbMATH OpenOpenAlexFDO

Authors G. Walker

Publication date 27 January 1997

Published in Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0305004100074661

zbMATH Keywords

explicit descriptionhook lengthshorizontal partitionsMullineaux involutionsrow regular partitionsSchur modulessimple quotients

Mathematics Subject Classification ID

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

Recommendations

• The \(k\)-partitioning problem
• ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
• Algorithms for non-crossing partitions
• Algorithms for tolerated Tverberg partitions
• FindingH-partitions efficiently
• The algorithmic complexity of \(k\)-domatic partition of graphs
• An algorithm for nontransitive partitions
• scientific article; zbMATH DE number 1185313
• scientific article; zbMATH DE number 1559404

Cites work

• Bijections of p -Regular Partitions and p -Modular Irreducibles of the Symmetric Groups
• Modular Schur Functions
• On Schur algebras and related algebras. II
• Schur and weyl functors, II

Cited in

(5)

• Relationship between Mullineux involution and the generalized regularization
• Combinatorial wall-crossing and the Mullineux involution
• On properties of the Mullineux map with an application to Schur modules
• Column-to-row operations on partitions: Garden of Eden partitions
• Composition factors of tensor products of truncated symmetric powers.

This page was built for publication: Horizontal partitions and Kleshchev's algorithm

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