On the Littlewood-Richardson rule in terms of lattice path combinatorics

DOI10.1016/0012-365X(88)90230-0MaRDI QIDQ2639079zbMATH OpenFDO

Authors Toshihiro Watanabe

Publication date 1988

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Littlewood-Richardson ruleSchur functions

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10)

Cites work

• scientific article; zbMATH DE number 3166255 (Why is no real title available?)
• scientific article; zbMATH DE number 3860011 (Why is no real title available?)
• scientific article; zbMATH DE number 3821741 (Why is no real title available?)
• scientific article; zbMATH DE number 3663377 (Why is no real title available?)
• scientific article; zbMATH DE number 3743261 (Why is no real title available?)
• scientific article; zbMATH DE number 3766017 (Why is no real title available?)
• scientific article; zbMATH DE number 3591052 (Why is no real title available?)
• Binomial determinants, paths, and hook length formulae
• Enumeration of permutations with prescribed up-down and inversion sequences
• Group characters and algebra
• La correspondance de Robinson
• Longest Increasing and Decreasing Subsequences
• Multiplying Schur functions
• On Schensted's construction and the multiplication of Schur functions
• On an inclusion-exclusion formula based on the reflection principle
• Permutations, matrices, and generalized Young tableaux
• Some connections between the Littlewood-Richardson rule and the construction of Schensted
• Symmetric functions and raising operators

Cited in

(1)

• On the product of a Schur function and a skew Schur function

This page was built for publication: On the Littlewood-Richardson rule in terms of lattice path combinatorics

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