Consecutive Patterns, Kostant's Problem and Type A6A_6

preprint2026arXivOpen access

Abstract

For a permutation ww in the symmetric group Sn\mathfrak{S}_{n}, let L(w)L(w) denote the 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}). We first prove that L(w)L(w) is Kostant negative whenever ww consecutively contains certain patterns. We then provide a complete answer to Kostant's problem in type A6A_{6} and show that the indecomposability conjecture also holds in type A6A_{6}, that is, applying an indecomposable projective functor to a simple module outputs either an indecomposable module or zero.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.