Assembling crystals of type A

From MaRDI portal
Publication:895942



Abstract: Regular An-crystals are certain edge-colored directed graphs which are related to representations of the quantized universal enveloping algebra Uq(mathfraksln+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 is used to give a recursive description of the combinatorial structure of K and develop an efficient procedure of assembling K.


Summary: Regular \(A_n\)-crystals are certain edge-colored directed graphs, which are related to representations of the quantized universal enveloping algebra \(U_q(\mathfrak{sl}_{n+1})\). For such a crystal \(K\) with colors \(1, 2, \dots, n\), we consider its maximal connected subcrystals with colors \(1, \dots, n-1\) and with colors \(2, \dots, 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\).











This page was built for publication: Assembling crystals of type A

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q895942)