A bijective proof of the Hook formula for the number of column strict tableaux with bounded entries
From MaRDI portal
Publication:1055414
DOI10.1016/S0195-6698(83)80008-0zbMath0521.05007WikidataQ114121535 ScholiaQ114121535MaRDI QIDQ1055414
Roger Whitney, Jeffery B. Remmel
Publication date: 1983
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Representations of finite symmetric groups (20C30)
Related Items
Interpretation of a basic hypergeometric identity with Lie characters and Young tableaux, The combinatorics of Jeff Remmel, A combinatorial proof of the Giambelli identity for Schur functions, Standard Young tableaux of height 4 and 5, Oscillating tableaux and nonintersecting lattice paths, Bijective proofs of some classical partition identities, Hook, line and sinker: a bijective proof of the skew shifted hook-length formula, The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications, Bruhat lattices, plane partition generating functions, and minuscule representations, A bijective proof of the generating function for the number of reverse plane partitions via lattice paths, Generating functions for plane partitions of a given shape, A bijective proof of the hook-length formula for skew shapes, A bijective proof of the hook-length formula for skew shapes, Another involution principle-free bijective proof of Stanley's hook-content formula, Computations versus bijections for tiling enumeration, Binomial determinants, paths, and hook length formulae
Cites Work
- Unnamed Item
- Binomial determinants, paths, and hook length formulae
- A Rogers-Ramanujan bijection
- A bijective proof of the generating function for the number of reverse plane partitions via lattice paths
- Bijective proofs of formulae for the number of standard Yound tableaux
- Theory and Application of Plane Partitions: Part 1
- Theory and Application of Plane Partitions. Part 2
- Ordered structures and partitions
