2006
DOI: 10.1007/s10468-005-0565-7
|View full text |Cite
|
Sign up to set email alerts
|

Geometric and Combinatorial Realizations of Crystal Graphs

Abstract: For irreducible integrable highest weight modules of the finite and affine Lie algebras of type A and D, we define an isomorphism between the geometric realization of the crystal graphs in terms of irreducible components of Nakajima quiver varieties and the combinatorial realizations in terms of Young tableaux and Young walls. For type A (1) n , we extend the Young wall construction to arbitrary level, describing a combinatorial realization of the crystals in terms of new objects which we call Young pyramids. … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
42
0

Year Published

2006
2006
2014
2014

Publication Types

Select...
5
2
1

Relationship

4
4

Authors

Journals

citations
Cited by 25 publications
(43 citation statements)
references
References 17 publications
1
42
0
Order By: Relevance
“…It is also worth noting that there are well-known bijections between the Lusztig parametrization, string parametrization, and semistandard Young tableaux in type A r . More details may be found in [27,29].…”
Section: Introductionmentioning
confidence: 99%
“…It is also worth noting that there are well-known bijections between the Lusztig parametrization, string parametrization, and semistandard Young tableaux in type A r . More details may be found in [27,29].…”
Section: Introductionmentioning
confidence: 99%
“…There are other, purely combinatorial, constructions of these crystals as well. In [17], the author described an explicit isomorphism between the geometric construction from quiver varieties and the combinatorial construction via Young tableaux and Young walls. One limitation of the quiver variety approach to Kac-Moody Lie algebras and their representations is that the geometric Lie algebra action is only defined for those algebras whose generalized Cartan matrix is symmetric.…”
Section: Introductionmentioning
confidence: 99%
“…We now undertake the task of giving an explicit description of this action in terms of the combinatorial data enumerating irreducible components. The arguments are similar to those used in [11]. 4.1.…”
Section: Combinatorial Crystal Graphsmentioning
confidence: 93%
“…In [11], an enumeration of the irreducible components of Nakajima's quiver varieties for finite and affine types A and D were given in terms of Young tableaux, Young walls and new objects called Young pyramids. In this section, we describe a natural enumeration of the irreducible components of Lusztig's quiver varieties in finite and affine type A.…”
Section: Enumeration Of Componentsmentioning
confidence: 99%
See 1 more Smart Citation