A simple proof of the Littlewood-Richardson rule and applications.

DOI10.1016/S0012-365X(98)00145-9zbMATH Open1061.05507MaRDI QIDQ1584473FDOQ1584473

Mark Shimozono, Jeffrey Remmel

Publication date: 2 November 2000

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

Recommendations

• A short proof of the Littlewood-Richardson rule
• An introduction to Schur polynomials
• scientific article; zbMATH DE number 1757343
• A generalized SXP rule proved by bijections and involutions
• Littlewood-Richardson without algorithmically defined bijections

zbMATH Keywords

involutionplethysmSchur function expansion

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05)

Cites Work

• Binomial determinants, paths, and hook length formulae
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A combinatorial interpretation of the inverse kostka matrix
• Crystal graphs and \(q\)-analogues of weight multiplicities for the root system \(A_ n\)
• A Littlewood-Richardson miscellany
• Group characters and algebra
• A cyclage poset structure for Littlewood-Richardson tableaux
• Multiplying Schur functions
• Title not available (Why is that?)
• Littlewood-Richardson without algorithmically defined bijections
• Some connections between the Littlewood-Richardson rule and the construction of Schensted
• A combinatorial rule for the schur function expansion of the PlethysmS(1^a,b)[P_k]

Cited In (21)

• Skew Schubert functions and the Pieri formula for flag manifolds
• Bases for coordinate rings of conjugacy classes of nilpotent matrices
• Title not available (Why is that?)
• Determinantal method and the Littlewood-Richardson rule
• Schur partial derivative operators
• Vanishing ideals of lattice diagram determinants
• A Littlewood-Richardson rule for dual stable Grothendieck polynomials
• Title not available (Why is that?)
• A positive proof of the Littlewood-Richardson rule using the octahedron recurrence
• Structure constants for \(K\)-theory of Grassmannians, revisited
• A combinatorial proof of the reduction formula for Littlewood-Richardson coefficients
• Littlewood-Richardson without algorithmically defined bijections
• The combinatorics of transition matrices between the bases of the symmetric functions and the \(B_ n\) analogues
• Linear programming with unitary-equivariant constraints
• ALGORITHM FOR MULTIPLYING SCHUBERT CLASSES
• Why should the Littlewood–Richardson Rule be true?
• The combinatorics of Jeff Remmel
• Noncommutative LR coefficients and crystal reflection operators
• A generalized SXP rule proved by bijections and involutions
• Littlewood-Richardson rules for Grassmannians
• Equivariant Littlewood-Richardson skew tableaux

This page was built for publication: A simple proof of the Littlewood-Richardson rule and applications.

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