Pages that link to "Item:Q1055414"
From MaRDI portal
The following pages link to A bijective proof of the Hook formula for the number of column strict tableaux with bounded entries (Q1055414):
Displaying 13 items.
- The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications (Q968254) (← links)
- Binomial determinants, paths, and hook length formulae (Q1066901) (← links)
- A combinatorial proof of the Giambelli identity for Schur functions (Q1112029) (← links)
- Standard Young tableaux of height 4 and 5 (Q1119584) (← links)
- Bijective proofs of some classical partition identities (Q1167170) (← links)
- Interpretation of a basic hypergeometric identity with Lie characters and Young tableaux (Q1343792) (← links)
- Another involution principle-free bijective proof of Stanley's hook-content formula (Q1806214) (← links)
- Oscillating tableaux and nonintersecting lattice paths (Q1923407) (← links)
- Hook, line and sinker: a bijective proof of the skew shifted hook-length formula (Q1987073) (← links)
- Computations versus bijections for tiling enumeration (Q2081913) (← links)
- Bruhat lattices, plane partition generating functions, and minuscule representations (Q2266716) (← links)
- Generating functions for plane partitions of a given shape (Q2277454) (← links)
- A bijective proof of the generating function for the number of reverse plane partitions via lattice paths (Q3344209) (← links)
