Consecutive Patterns, Kostant's Problem and Type
arXiv:2503.07809
Abstract
For a permutation in the symmetric group , let denote the simple highest weight module in the principal block of the BGG category for the Lie algebra . We first prove that is Kostant negative whenever consecutively contains certain patterns. We then provide a complete answer to Kostant's problem in type and show that the indecomposability conjecture also holds in type , that is, applying an indecomposable projective functor to a simple module outputs either an indecomposable module or zero.
revised version accepted for publication in Int. J. Alg. Comput