Schensted type correspondence for type and computation of the canonical basis of a finite dimensional -module
arXiv:math/0211443
Abstract
We use Kang-Misra's combinatorial description of the crystal graphs for to introduce the plactic monoid for type . Then we describe the corresponding insertion algorithm which yields a Schensted type correspondence. Next we give a simple algorithm for computing the canonical basis of any finite dimensional -module.
19 pages