Schensted type correspondence for type G2 and computation of the canonical basis of a finite dimensional Uq(G2)-module

Abstract

We use Kang-Misra's combinatorial description of the crystal graphs for Uq(G2) to introduce the plactic monoid for type G2. 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 Uq(G2)-module.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…