Consecutive Patterns, Kostant's Problem and Type A6
Abstract
For a permutation w in the symmetric group Sn, let L(w) denote the simple highest weight module in the principal block of the BGG category O for the Lie algebra sln(C). We first prove that L(w) is Kostant negative whenever w consecutively contains certain patterns. We then provide a complete answer to Kostant's problem in type A6 and show that the indecomposability conjecture also holds in type A6, that is, applying an indecomposable projective functor to a simple 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.