Double Crystal Graphs

By Alain Lascoux. 2003

58 citations recorded by the source corpus.

Subfields: Algebra and Number Theory, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/336b9a6f426babd3c57fb9a405e7eb6287d942d7

Citations in the corpus

• ON THE COMBINATORICS OF CRYSTAL GRAPHS, I. LUSZTIG'S INVOLUTION (2005, unknown): “uld be able to explain the whole combinatorics of our model. Note the analogy with type A, where we have left strings and right strings, defined via root operators and jeu de taquin, respectively (cf. [17]). Define an action of a simple reflection sp on an admissible subset Jby (4.21) sp(J) := F hµ(J),”