Rational tableaux and the tensor algebra of \(gl_ n\) (Q580499): Difference between revisions

The use of Young tableaux to study polynomial representations of GL(n) is well known. \textit{R. C. King} [J. Math. Phys. 11, 280-293 (1970; Zbl 0199.346) and J. Phys. A 16, 3153-3177 (1983; Zbl 0522.22015)] has proposed an analogous structure for the study of rational representations of GL(n). In this paper, the author defines rational tableaux, objects equivalent to King's construction. He generalizes the Schensted insertion algorithm to rational tableaux, finds an analogue of the Robinson-Schensted-Knuth insertion algorithm, and uses the techniques he has developed to prove theorems of Hanlon and Stanley on the decomposition of \(gl_ n^{\otimes k}\) into irreducible \(S_ k\times GL_ n\)-modules in the limit \(n\to \infty\).