Kostant cuspidal permutations
Samuel Creedon, Volodymyr Mazorchuk

TL;DR
This paper investigates Kostant cuspidal permutations within the context of Kostant's problem, establishing invariance properties, classifying certain involutions, and exploring the complexity of Kostant cuspidal elements as the rank increases.
Contribution
It introduces the notion of Kostant cuspidal permutations, proves their invariance under Kazhdan-Lusztig left cells, and classifies infinite families of Kostant cuspidal involutions.
Findings
Kostant cuspidality is an invariant of Kazhdan-Lusztig left cells.
Four infinite families of Kostant cuspidal involutions are described.
The number of Kostant cuspidal elements can grow arbitrarily large with rank.
Abstract
In relation to Kostant's problem for simple highest weight modules over the general linear Lie algebra, we prove a persistence result for Kostant negative consecutive patterns. Inspired by it, we introduce the notion of a Kostant cuspidal permutation as a minimal Kostant negative consecutive pattern. It is shown that Kostant cuspidality is an invariant of a Kazhdan-Lusztig left cell. We describe four infinite families of Kostant cuspidal involutions, including a complete classification of Kostant cuspidal fully commutative involutions. In particular, we show that the number of new Kostant cuspidal elements can be arbitrarily large, when the rank grows. This provides some potential explanation why Kostant's problem is hard.
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 Algebra and Geometry · Advanced Topics in Algebra
