Littlewood-Richardson without algorithmically defined bijections

zbMath0978.05538MaRDI QIDQ5946789

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

zbMATH Keywords

Schur functionsLittlewood-Richardson rule

Mathematics Subject Classification ID

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

Related Items (3)

Symmetric functions, codes of partitions and the KP hierarchy ⋮ A recursion formula for \(k\)-Schur functions ⋮ A simple proof of the Littlewood-Richardson rule and applications.

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