The Robinson-Schensted Correspondence and $A_2$-web Bases

Abstract

We study natural bases for two constructions of the irreducible representation of the symmetric group corresponding to $[n,n,n]$: the {\em reduced web} basis associated to Kuperberg's combinatorial description of the spider category; and the {\em left cell basis} for the left cell construction of Kazhdan and Lusztig. In the case of $[n,n]$, the spider category is the Temperley-Lieb category; reduced webs correspond to planar matchings, which are equivalent to left cell bases. This paper compares the images of these bases under classical maps: the {\em Robinson-Schensted algorithm} between permutations and Young tableaux and {\em Khovanov-Kuperberg's bijection} between Young tableaux and reduced webs. One main result uses Vogan's generalized $\ddot{I}„$-invariant to uncover a close structural relationship between the web basis and the left cell basis. Intuitively, generalized $\ddot{I}„$-invariants refine the data of the inversion set of a permutation. We define generalized $\ddot{I}„$-invariants intrinsically for Kazhdan-Lusztig left cell basis elements and for webs. We then show that the generalized $\ddot{I}„$-invariant is preserved by these classical maps. Thus, our result allows one to interpret Khovanov-Kuperberg's bijection as an analogue of the Robinson-Schensted correspondence. Despite all of this, our second main result proves that the reduced web and left cell bases are inequivalent; that is, these bijections are not $S_{3n}$-equivariant maps.

34 pages, 23 figures, minor corrections and revisions in version 2