2002
DOI: 10.1090/s0002-9947-02-03064-7
|View full text |Cite
|
Sign up to set email alerts
|

π‘Žπ‘‘-nilpotent π”Ÿ-ideals in 𝔰𝔩(𝔫) having a fixed class of nilpotence: combinatorics and enumeration

Abstract: Abstract. We study the combinatorics of ad-nilpotent ideals of a Borel subalgebra of sl(n + 1, C). We provide an inductive method for calculating the class of nilpotence of these ideals and formulas for the number of ideals having a given class of nilpotence. We study the relationships between these results and the combinatorics of Dyck paths, based upon a remarkable bijection between ad-nilpotent ideals and Dyck paths. Finally, we propose a (q, t)-analogue of the Catalan number Cn. These (q, t)-Catalan number… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
62
0

Year Published

2002
2002
2021
2021

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 31 publications
(62 citation statements)
references
References 13 publications
0
62
0
Order By: Relevance
“…Since Ξ»(O I ) = Ξ» I by Corollary 6.2, it is clear that (Ξ» I ) 1 is the smallest positive integer k such A k = 0 for all A ∈ I. Moreover, it is pointed out in [11, p. 536] that (Ξ» I ) 1 is the index of nilpotence of I as an associative algebra, while in [2] it is shown that (Ξ» I ) 1 is the index of nilpotence of I as a Lie algebra (actually, the latter use the class of nilpotence to refer to the number of brackets needed to get to zero, which equals (Ξ» I ) 1 βˆ’ 1, i.e., the bounce count). We will say that I has index k.…”
Section: If Eithermentioning
confidence: 99%
See 2 more Smart Citations
“…Since Ξ»(O I ) = Ξ» I by Corollary 6.2, it is clear that (Ξ» I ) 1 is the smallest positive integer k such A k = 0 for all A ∈ I. Moreover, it is pointed out in [11, p. 536] that (Ξ» I ) 1 is the index of nilpotence of I as an associative algebra, while in [2] it is shown that (Ξ» I ) 1 is the index of nilpotence of I as a Lie algebra (actually, the latter use the class of nilpotence to refer to the number of brackets needed to get to zero, which equals (Ξ» I ) 1 βˆ’ 1, i.e., the bounce count). We will say that I has index k.…”
Section: If Eithermentioning
confidence: 99%
“…. , i r ) of I was subsequently re-introduced in the literature [2] and then adapted to Dyck paths [12], where it determines the bounce path. Visually, this is the lattice path that traces the lower boundary of the ideal I := n P where P = P i2βˆ’1,...,irβˆ’1 .…”
Section: Two Applicationsmentioning
confidence: 99%
See 1 more Smart Citation
“…This proves that (2.3) and (2.5) are equal. The inverse of the zeta map first appeared connection with nilpotent ideals in certain Borel subalgebras of sl(n) [AKOP02]. For its connections with the combinatorics of q, t-Catalan polynomials, see [Hag08].…”
Section: Background and Definitionsmentioning
confidence: 99%
“…Shortly thereafter, Haiman announced a different combinatorial formula using the area and dinv statistics (see (2.3)). The zeta map [AKOP02,Hag08] relates these two combinatorial formulas. One of the main open problems related to the q, t-Catalan polynomials C n (q, t) is a combinatorial proof of its symmetry in q and t.…”
Section: Introductionmentioning
confidence: 99%