A combinatorial proof of the equivalence of the classical and combinatorial definitions of Schur function

DOI10.1016/0097-3165(95)90066-7zbMath0853.05082OpenAlexW2012995322MaRDI QIDQ1903010

Andrius Kulikauskas, Jeffery B. Remmel, Joaquin O. Carbonara

Publication date: 9 December 1996

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(95)90066-7

zbMATH Keywords

equivalencetableauxSchur function

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of representation theory (05E10) Representations of finite symmetric groups (20C30)

Related Items (2)

The combinatorics of Jeff Remmel ⋮ The loop Murnaghan-Nakayama rule

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equivalence of the combinatorial and the classical definitions of Schur functions
• Binomial determinants, paths, and hook length formulae
• A combinatorial interpretation of q-derangement and q-Laguerre numbers
• A Rogers-Ramanujan bijection
• Determinental formulae for complete symmetric functions
• Schur functions: Theme and variations
• Directed Graphs and the Jacobi-Trudi Identity
• Tournaments and Vandermond's determinant

This page was built for publication: A combinatorial proof of the equivalence of the classical and combinatorial definitions of Schur function