A bijective proof of the hook-length formula for standard immaculate tableaux
classification
🧮 math.CO
keywords
proofformulahook-lengthstandardtableauxbijectiveimmaculatealong
read the original abstract
In this paper, we present a direct bijective proof of the hook-length formula for standard immaculate tableaux, which arose in the study of non-commutative symmetric functions. Our proof is along the spirit of Novelli, Pak and Stoyanovskii's combinatorial proof of the hook-length formula for standard Young tableaux.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.