English

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 zz in the symmetric group Sn\mathrm{S}_{n}, denote by LzL_{z} the corresponding simple highest weight module in the principal block of the BGG category O\mathcal{O} for the Lie algebra sln(C)\mathfrak{sl}_{n}(\mathbb{C}). In this paper, we provide a combinatorial answer to Kostant's problem for the modules LzL_{z} when zz has shape (associated Young diagram/integer partition via Robinson-Schensted correspondence) equal to (n2,1,1)(n-2,1,1) or (n3,2,1)(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.

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}
}