An Eightfold Littlewood-Richardson Theorem

Authors

  • Manfred Schocker

DOI:

https://doi.org/10.1285/i15900932v21n1p1

Keywords:

Schensted insertion, Generalized ordering, Tableau

Abstract

Based on a generalized ordering $\propto$ on a set $X$, Schensted's  insertion mapping is defined on the set of words $(W,\cdot)$ over the ordered alphabet $(X,\propto)$. In this general framework, a transparent approach to various versions of the Robinson-Schensted correspondence and of invariant properties originally due to Schützenberger, Knuth, White e.a. is obtained.  Furthermore, eight combinatorial descriptions of the Littlewood-Richardson coefficients are obtained simultaneously, and direct bijections between the corresponding sets, including the bijection of Hanlon and Sundaram. Some of these descriptions may be translated into identities of skew Schur functions discovered by Aitken and Berenstein/Zelevinsky.

Downloads

Published

01-01-2002

Issue

Section

Articoli