Kostant's problem for permutations of shape $(n-2,1,1)$ and $(n-3,2,1)$
Representation Theory
2026-01-28 v1 Combinatorics
Abstract
For a permutation in the symmetric group , denote by the corresponding simple highest weight module in the principal block of the BGG category for the Lie algebra . In this paper, we provide a combinatorial answer to Kostant's problem for the modules when has shape (associated Young diagram/integer partition via Robinson-Schensted correspondence) equal to or . 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.
Keywords
Cite
@article{arxiv.2601.19537,
title = {Kostant's problem for permutations of shape $(n-2,1,1)$ and $(n-3,2,1)$},
author = {Samuel Creedon and Volodymyr Mazorchuk},
journal= {arXiv preprint arXiv:2601.19537},
year = {2026}
}