Kostant's problem for permutations of shape (n-2,1,1) and (n-3,2,1)
Abstract
For a permutation z in the symmetric group Sn, denote by Lz the corresponding simple highest weight module in the principal block of the BGG category O for the Lie algebra sln(C). In this paper, we provide a combinatorial answer to Kostant's problem for the modules Lz when z has shape (associated Young diagram/integer partition via Robinson-Schensted correspondence) equal to (n-2,1,1) or (n-3,2,1). Moreover, we verify that certain closely related conjectures hold for such permutations, including the Indecomposability Conjecture, which states that applying any indecomposable projective functor to the corresponding simple highest weight module outputs either an indecomposable module or zero.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.