Bijective proofs of formulae for the number of standard Yound tableaux

DOI10.1080/03081088208817432zbMath0485.05005OpenAlexW1996722137WikidataQ114100514 ScholiaQ114100514MaRDI QIDQ3944609

Jeffery B. Remmel

Publication date: 1982

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

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

zbMATH Keywords

hook length formulastandard young tableaux

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Representations of finite symmetric groups (20C30)

Related Items

The combinatorics of Jeff Remmel, A combinatorial proof of the Giambelli identity for Schur functions, Standard Young tableaux of height 4 and 5, Hook formulas for skew shapes. I: \(q\)-analogues and bijections, Hook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications, Quantum cohomology of Hilb\(_n(\mathbb C^2)\) and the weighted hook walk on Young diagrams, Bijective proofs of some classical partition identities, The weighted hook length formula, On an identity of Glass and Ng concerning the hook length formula, A bijective proof of the generating function for the number of reverse plane partitions via lattice paths, A bijective proof of the Hook formula for the number of column strict tableaux with bounded entries, Binomial determinants, paths, and hook length formulae

Cites Work

• Reverse plane partitions and tableau hook numbers
• A probabilistic proof of a formula for the number of Young tableaux of a given shape
• Theory and Application of Plane Partitions. Part 2
• The Hook Graphs of the Symmetric Group