A bijective proof of the hook-length formula for standard immaculate tableaux

DOI10.1090/proc/12899zbMath1331.05226arXiv1503.04280OpenAlexW1919373218WikidataQ114094237 ScholiaQ114094237MaRDI QIDQ2790175

No author found.

Publication date: 3 March 2016

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.04280

zbMATH Keywords

compositionhook-length formulahookimmaculate tableaustandard immaculate tableau

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10)

Related Items (2)

Homological properties of 0-Hecke modules for dual immaculate quasisymmetric functions ⋮ A probabilistic method for the number of standard immaculate tableaux

Cites Work

• Unnamed Item
• Reverse plane partitions and tableau hook numbers
• A probabilistic proof of a formula for the number of Young tableaux of a given shape
• A bijective proof of the hook-length formula and its analogs
• A bijective proof of the hook-length formula
• A Lift of the Schur and Hall–Littlewood Bases to Non-commutative Symmetric Functions
• The Hook Graphs of the Symmetric Group

This page was built for publication: A bijective proof of the hook-length formula for standard immaculate tableaux