A bijective proof of a factorization theorem for (k,l)-hook schur functions

DOI10.1080/03081089008818037zbMath0749.05067WikidataQ114100507 ScholiaQ114100507MaRDI QIDQ3970531

Jeffery B. Remmel

Publication date: 25 June 1992

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081089008818037

zbMATH Keywords

Schur functions; semistandard tableaux; factorisation identities

Mathematics Subject Classification ID

05E10: Combinatorial aspects of representation theory

Related Items

Bounds on colength and maximal multiplicity sequences., Basic derivations for subarrangements of Coxeter arrangements, Shuffle invariance of the super-RSK algorithm, Permutation statistics and \((k,\ell)\)-hook Schur functions, Statistiques d'ordre sur les permutations colorées. (Order statistics on coloured permutations), Performance evaluation of demodulation with diversity -- a combinatorial approach. II: Bijective methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hook flag characters and their combinatorics
• Hook Young diagrams with applications to combinatorics and to representations of Lie superalgebras
• Permutations, matrices, and generalized Young tableaux
• Longest Increasing and Decreasing Subsequences
• La correspondance de Robinson
• Theory and Application of Plane Partitions. Part 2