Séminaire Lotharingien de Combinatoire, B20k (1988), 6 pp.
[Formerly: Publ. I.R.M.A. Strasbourg, 1988, 372/S-20, p. 101-107.]
Littlewood-Richardson without Algorithmically Defined Bijections
We give an alternative proof of the classical Littlewood-Richardson rule,
which is less "tableau-theoretic" than many earlier ones.
The best of the
earlier proofs have considerable combinatorial explanatory power. The
proof below explains only why the product of two Schur functions is
what it is.
The following versions are available: