A bijective proof of the hook-length formula for standard immaculate tableaux
Combinatorics
2015-03-17 v1
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.
Keywords
Cite
@article{arxiv.1503.04280,
title = {A bijective proof of the hook-length formula for standard immaculate tableaux},
author = {Emma L. L. Gao and Arthur L. B. Yang},
journal= {arXiv preprint arXiv:1503.04280},
year = {2015}
}
Comments
10 pages, 10 figures