2017
DOI: 10.1093/imrn/rnx247
|View full text |Cite
|
Sign up to set email alerts
|

Gelfand–Kirillov Dimensions of Highest Weight Harish-Chandra Modules for $\boldsymbol{{SU}(p,q)}$

Abstract: Let (G, K) be an irreducible Hermitian symmetric pair of noncompact type with G = SU (p, q), and let λ be an integral weight such that the simple highest weight module L(λ) is a Harish-Chandra (g, K)-module. We give a combinatorial algorithm for the Gelfand-Kirillov dimension of L(λ). This enables us to prove that the Gelfand-Kirillov dimension of L(λ) decreases as the integer λ + ρ, β ∨ increases, where ρ is the half sum of positive roots and β is the maximal noncompact root. Finally by the combinatorial algo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
26
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
3

Relationship

3
5

Authors

Journals

citations
Cited by 12 publications
(26 citation statements)
references
References 18 publications
0
26
0
Order By: Relevance
“…The Young tableaux with only two columns always appear in representation theory of Lie algebras and Lie groups, see for example [2]. Now we pay attention on KL right cells corresponding to these special tableaux.…”
Section: Young Tableaux With Two Columnsmentioning
confidence: 99%
“…The Young tableaux with only two columns always appear in representation theory of Lie algebras and Lie groups, see for example [2]. Now we pay attention on KL right cells corresponding to these special tableaux.…”
Section: Young Tableaux With Two Columnsmentioning
confidence: 99%
“…In [17, §1], Lusztig gives a formula connecting the Gelfand-Kirillov dimension and the Lusztig's a-function. The following proposition is a generalized form of Lusztig's formula, see [2,Prop.3.8].…”
Section: 1mentioning
confidence: 99%
“…By Schensted insertion, the Young tableau Y a (x) associated to x has at most two columns. By Proposition 5.3 and Example 5.4 of [2], there is an algorithm of determining entries in the second column of Y a (x). Let us recall it.…”
Section: Letmentioning
confidence: 99%
See 1 more Smart Citation
“…Sometime we will write it as O m (p, q) to emphasize that it comes from SU (p, q). From Bai-Xie [2] or NOTYK [15], we know dim O j = j(n − j).…”
Section: And We Havementioning
confidence: 99%