A simple proof of the Littlewood-Richardson rule and applications.
From MaRDI portal
(Redirected from Publication:1584473)
Recommendations
Cites work
- scientific article; zbMATH DE number 3886117 (Why is no real title available?)
- scientific article; zbMATH DE number 3817997 (Why is no real title available?)
- scientific article; zbMATH DE number 4103347 (Why is no real title available?)
- scientific article; zbMATH DE number 3766017 (Why is no real title available?)
- A Littlewood-Richardson miscellany
- A combinatorial interpretation of the inverse kostka matrix
- A combinatorial rule for the schur function expansion of the PlethysmS(1a,b)[Pk]
- A cyclage poset structure for Littlewood-Richardson tableaux
- Binomial determinants, paths, and hook length formulae
- Crystal graphs and \(q\)-analogues of weight multiplicities for the root system \(A_ n\)
- Group characters and algebra
- Littlewood-Richardson without algorithmically defined bijections
- Multiplying Schur functions
- Some connections between the Littlewood-Richardson rule and the construction of Schensted
Cited in
(22)- Equivariant Littlewood-Richardson skew tableaux
- Skew Schubert functions and the Pieri formula for flag manifolds
- Bases for coordinate rings of conjugacy classes of nilpotent matrices
- An algorithmic Littlewood-Richardson rule
- scientific article; zbMATH DE number 1757343 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 149529 (Why is no real title available?)
- 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
- The combinatorics of transition matrices between the bases of the symmetric functions and the \(B_ n\) analogues
- Littlewood-Richardson without algorithmically defined bijections
- Linear programming with unitary-equivariant constraints
- ALGORITHM FOR MULTIPLYING SCHUBERT CLASSES
- 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
- Why should the Littlewood-Richardson rule be true?
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)
