Kostant cuspidal permutations
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908766739365888 |
|---|---|
| author | Creedon, Samuel Mazorchuk, Volodymyr |
| author_facet | Creedon, Samuel Mazorchuk, Volodymyr |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_09824 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Kostant cuspidal permutations Creedon, Samuel Mazorchuk, Volodymyr Representation Theory Combinatorics 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. |
| title | Kostant cuspidal permutations |
| topic | Representation Theory Combinatorics |
| url | https://arxiv.org/abs/2601.09824 |