Almost all permutations and involutions are Kostant negative

2024/11/20 by Creedon, Samuel, Mazorchuk, Volodymyr · 1 citation
#FOS: Mathematics #Representation Theory (math.RT)

paper · doi:10.48550/arxiv.2411.13043

Abstract

We prove that, when n goes to infinity, Kostant's problem has negative answer for almost all simple highest weight modules in the principal block of the BGG category O for the Lie algebra \mathfraksl_n(ℂ).

Cited by

• Hecke combinatorics, Kåhrström's conditions and Kostant's problem

Related

• Consecutive Patterns, Kostant's Problem and Type A₆
• Kostant's problem for fully commutative permutations
• Kostant's problem for Whittaker modules
• Kostant modules in blocks of category \mathcal O_S
• The tale of Kostant's problem