Littlewood-Richardson without algorithmically defined bijections

MaRDI QIDQ5946789zbMATH OpenFDO

Authors Peter N. Hoffman

Publication date 5 November 2001

Published in Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/121537, http://www.emis.de/journals/SLC/opapers/s20hoffman.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Littlewood-Richardson ruleSchur functions

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10)

Recommendations

• scientific article; zbMATH DE number 1757343
• Why should the Littlewood-Richardson rule be true?
• A simple proof of the Littlewood-Richardson rule and applications.
• A short proof of the Littlewood-Richardson rule
• An introduction to Schur polynomials

Cited in

(11)

• An introduction to Schur polynomials
• An algorithmic Littlewood-Richardson rule
• scientific article; zbMATH DE number 1757343 (Why is no real title available?)
• The Robinson-Schensted-Knuth correspondence and the Littlewood-Richardson rule
• Schubert polynomials and the Littlewood-Richardson rule
• A simple proof of the Littlewood-Richardson rule and applications.
• Symmetric functions, codes of partitions and the KP hierarchy
• A recursion formula for k-Schur functions
• Bipieri tableaux
• THE RULE OF LITTLEWOOD-RICHARDSON IN A CONSTRUCTION OF BERENSTEIN-ZELEVINSKY
• Why should the Littlewood-Richardson rule be true?

This page was built for publication: Littlewood-Richardson without algorithmically defined bijections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5946789)