Home > eBooks > MSJ Memoirs > Combinatorial Aspect of Integrable Systems > Part 2. Combinatorics of Crystal Graphs for the Root Systems of Types $A_n$, $B_n$, $C_n$, $D_n$ and $G_2$
Translator Disclaimer
VOL. 17 | 2007 Part 2. Combinatorics of Crystal Graphs for the Root Systems of Types $A_n$, $B_n$, $C_n$, $D_n$ and $G_2$

## Abstract

This note is devoted to the combinatorics of tableaux for the root systems $B_n$, $C_n$, $D_n$ and $G_2$ defined from Kashiwara's crystal graph theory. We review the definition of tableaux for types $B_n$, $C_n$, $D_n$ and $G_2$ and describe the corresponding bumping and sliding algorithms. We also derive in each case a Robinson-Schensted type correspondence.

## Information

Published: 1 January 2007
First available in Project Euclid: 24 November 2014

zbMATH: 1131.05095
MathSciNet: MR2269126

Digital Object Identifier: 10.2969/msjmemoirs/01701C020

Rights: Copyright © 2007, The Mathematical Society of Japan

CHAPTER
31 PAGES

SHARE
Vol. 17 • 1 January 2007