Assembling crystals of type A
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\).
- \(B_2\)-crystals: axioms, structure, models
- A local characterization of simply-laced crystals
- Combinatorics of regular \(A_{2}\)-crystals
- Cones, crystals, and patterns
- Crystal graphs for representations of the q-analogue of classical Lie algebras
- Crystalizing the q-analogue of universal enveloping algebras
- Paths and root operators in representation theory
- The crossing model for regular \(A_n\)-crystals
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)