Assembling Crystals of Type A
Keyword(s):
Type A
◽
Regular An-crystals are certain edge-colored directed graphs, which are related to representations of the quantized universal enveloping algebra Uq(𝔰𝔩n+1). For such a crystal K with colors 1,2,…,n, we consider its maximal connected subcrystals with colors 1,…,n-1 and with colors 2,…,n and characterize the interlacing structure for all pairs of these subcrystals. This enables us to give a recursive description of the combinatorial structure of K via subcrystals and develop an efficient procedure of assembling K.
1990 ◽
Vol 3
(1)
◽
pp. 257-257
◽
2009 ◽
Vol 23
(30)
◽
pp. 5649-5656
2016 ◽
Vol 59
(5)
◽
pp. 849-860
◽
Keyword(s):
2010 ◽
Vol 138
(09)
◽
pp. 3135-3135
◽
2009 ◽
Vol 86
(1)
◽
pp. 1-15
◽
1998 ◽
Vol 26
(3-4)
◽
pp. 247-271
◽