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

DOI10.1016/0012-365X(88)90230-0zbMATH Open0718.05060MaRDI QIDQ2639079FDOQ2639079

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

• Binomial determinants, paths, and hook length formulae
• Permutations, matrices, and generalized Young tableaux
• Longest Increasing and Decreasing Subsequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• La correspondance de Robinson
• Enumeration of permutations with prescribed up-down and inversion sequences
• On Schensted's construction and the multiplication of Schur functions
• Group characters and algebra
• Multiplying Schur functions
• Symmetric functions and raising operators
• On an inclusion-exclusion formula based on the reflection principle
• Title not available (Why is that?)
• Some connections between the Littlewood-Richardson rule and the construction of Schensted
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)