Schensted type correspondence for type $G_{2}$ and computation of the canonical basis of a finite dimensional $U_{q}(G_{2})$-module

Simple item page
dc.creatorLecouvey, cedric
dc.date2002-11-28
dc.date.accessioned2026-07-07T04:53:22Z
dc.date.available2026-07-07T04:53:22Z
dc.descriptionWe use Kang-Misra's combinatorial description of the crystal graphs for $U_{q}(G_{2})$ to introduce the plactic monoid for type $G_{2}$. 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 $U_{q}(G_{2})$-module.
dc.description19 pages
dc.identifierhttps://arxiv.org/abs/math/0211443
dc.identifierhttp://arxiv.org/abs/math/0211443
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/65823
dc.subjectCombinatorics
dc.subjectQuantum Algebra
dc.titleSchensted type correspondence for type $G_{2}$ and computation of the canonical basis of a finite dimensional $U_{q}(G_{2})$-module
dc.typetext

Files

Collections

arXiv