Kostant's problem for fully commutative permutations
Marco Mackaay, Volodymyr Mazorchuk, Vanessa Miemietz

TL;DR
This paper provides a comprehensive combinatorial solution to Kostant's problem for certain modules associated with fully commutative permutations and extends the theory to bicategories, generalizing existing theorems.
Contribution
It offers a complete combinatorial characterization for Kostant's problem in the context of fully commutative permutations and introduces a reformulation within fiab bicategories.
Findings
Complete combinatorial solution to Kostant's problem for fully commutative permutations
Reformulation of Kostant's problem in fiab bicategories
Classification of annihilators of simple objects in principal birepresentations
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Topics in Algebra · Advanced Algebra and Geometry
