Perforated tableaux: a combinatorial model for crystal graphs in type A_n - 1
From MaRDI portal
Publication:6090809
Abstract: We present a combinatorial model, called emph{perforated tableaux}, to study crystals, unifying several previously studied combinatorial models. We identify nodes in the -fold tensor product of the standard crystal with length words in . We model this crystal with perforated tableaux (ptableaux), extending this identification isomorphically to biwords, RSK tableaux pairs, and matrix models. In the ptableaux setting, crystal operators are more simply defined and we can identify highest weights visually without computation. We generalize the tensor products in the Littlewood-Richardson rule to all of , and not just the irreducible crystals whose reading words come from semistandard Young tableaux. We relate evacuation (Lusztig involution) to products of ptableaux crystal operators, and find a combinatorial algorithm to compute commutators of highest weight ptableaux.
Recommendations
- Geometric and combinatorial realizations of crystals of enveloping algebras
- Promotion, evacuation and cactus groups
- Bumping operators and insertion algorithms for queer supercrystals
- A uniform realization of the combinatorial \(R\)-matrix
- Double crystals of binary and integral matrices
- Lusztig data of Kashiwara-Nakashima tableaux in types B and C
- On combinatorial models for affine crystals
- scientific article; zbMATH DE number 1592780
- A uniform realization of the combinatorial \(R\)-matrix for column shape Kirillov-Reshetikhin crystals
- scientific article; zbMATH DE number 6806036
Cites work
- scientific article; zbMATH DE number 1001729 (Why is no real title available?)
- Canonical bases for the quantum group of type A_r and piecewise-linear combinatorics
- Combinatorial Howe duality of symplectic type
- Crystal bases. Representations and combinatorics
- Crystal graphs for representations of the q-analogue of classical Lie algebras
- Double crystals of binary and integral matrices
- Duality and bicrystals on infinite binary matrices
- Kostka polynomials and energy functions in solvable lattice models
- Non-symmetric Cauchy kernels for the classical groups
- On the combinatorics of crystal graphs, II. The crystal commutor
- On the combinatorics of crystal graphs. I: Lusztig's involution
- Tableau switching: Algorithms and applications
- The octahedron recurrence and \(\mathfrak{gl}_n\) crystals
Cited in
(2)
This page was built for publication: Perforated tableaux: a combinatorial model for crystal graphs in type \(A_{n - 1}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090809)