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

DOI10.1016/0012-365X(88)90230-0zbMath0718.05060MaRDI QIDQ2639079

Toshihiro Watanabe

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Schur functionsLittlewood-Richardson rule

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10)

Related Items (1)

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

Cites Work

• Binomial determinants, paths, and hook length formulae
• Some connections between the Littlewood-Richardson rule and the construction of Schensted
• Enumeration of permutations with prescribed up-down and inversion sequences
• 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
• Multiplying Schur functions
• Longest Increasing and Decreasing Subsequences
• Symmetric functions and raising operators
• La correspondance de Robinson
• Group characters and algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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