论文标题
Kostant的完全交换排列问题
Kostant's problem for fully commutative permutations
论文作者
论文摘要
我们对Kostant的问题给出了完整的组合答案，该问题是通过完全交换排列索引的简单最高权重模块。我们还提出了在Fiab Bicategories的背景下对Kostant问题进行重新制定的，并将简单对象的歼灭者分类为此类生物学的主要bigicategoriations，它概括了Barbasch-vogan Therem for Lie代数。
We give a complete combinatorial answer to Kostant's problem for simple highest weight modules indexed by fully commutative permutations. We also propose a reformulation of Kostant's problem in the context of fiab bicategories and classify annihilators of simple objects in the principal birepresentations of such bicategories generalising the Barbasch--Vogan theorem for Lie algebras.
