A bijective proof of the hook-length formula for standard immaculate tableaux-Reference-Cited by-同舟云学术

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

Published:2015-09-24 Issue:3 Volume:144 Page:989-998
ISSN:0002-9939
Container-title:Proceedings of the American Mathematical Society
language:en
Short-container-title:Proc. Amer. Math. Soc.

Author:

Gao Alice,Yang Arthur

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 Stoyanovskiĭ’s combinatorial proof of the hook-length formula for standard Young tableaux.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/proc/2016-144-03/S0002-9939-2015-12899-7/S0002-9939-2015-12899-7.pdf

Reference7 articles.

1. A lift of the Schur and Hall-Littlewood bases to non-commutative symmetric functions;Berg, Chris;Canad. J. Math.,2014

2. The hook graphs of the symmetric groups;Frame, J. S.;Canad. J. Math.,1954

3. A bijective proof of the hook-length formula;Franzblau, D. S.;J. Algorithms,1982

4. A probabilistic proof of a formula for the number of Young tableaux of a given shape;Greene, Curtis;Adv. in Math.,1979

5. Reverse plane partitions and tableau hook numbers;Hillman, A. P.;J. Combinatorial Theory Ser. A,1976

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Homological properties of 0-Hecke modules for dual immaculate quasisymmetric functions;Forum of Mathematics, Sigma;2022

2. A probabilistic method for the number of standard immaculate tableaux;Rocky Mountain Journal of Mathematics;2018-12-01