Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

25

COMBINATORICS
2002

favoriteEmaildiscussreport

89views more COMBINATORICS 2002»

A Concise Proof of the Littlewood-Richardson Rule

13 years 10 months ago

A Concise Proof of the Littlewood-Richardson Rule

Download www.combinatorics.org

We give a short proof of the Littlewood-Richardson rule using a sign-reversing involution.

John R. Stembridge

Real-time Traffic

COMBINATORICS 2002 | Littlewood-Richardson Rule | Short Proof |

claim paper

Related Content

» A Positive Proof of the LittlewoodRichardson Rule using the Octahedron Recurrence

» Constraining Credential Usage in LogicBased Access Control

» Ott effective tool support for the working semanticist

» A Resolution Calculus with Shared Literals

» Computational selfassembly

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2002
Where	COMBINATORICS
Authors	John R. Stembridge

Comments (0)