Codes and shifted codes of partitions
From MaRDI portal
Abstract: In a recent paper, Carrell and Goulden found a combinatorial identity of the Bernstein operators that they then used to prove Bernstein's Theorem. We show that this identity is a straightforward consequence of the classical result. We also show how a similar approach using the codes of partitions can be generalized from Schur functions to also include Schur -functions and derive the combinatorial formulation for both cases. We then apply them by examining the Littlewood-Richardson and Pieri Rules.
Recommendations
Cites work
- A new realization of the basic representation of \(A_ n^{(1)}\)
- scientific article; zbMATH DE number 51129 (Why is no real title available?)
- scientific article; zbMATH DE number 1181673 (Why is no real title available?)
- scientific article; zbMATH DE number 1460694 (Why is no real title available?)
- Infinite wedge and random partitions
- Representations of finite classical groups. A Hopf algebra approach
- Shifted tableaux and the projective representations of symmetric groups
- Symmetric functions, codes of partitions and the KP hierarchy
- Vertex operators, symmetric functions, and the spin group \(\Gamma_ n\)
Cited in
(5)
This page was built for publication: Codes and shifted codes of partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3110896)