2000 character limit reached
A bijective proof of the hook-length formula for standard immaculate tableaux
Published 14 Mar 2015 in math.CO | (1503.04280v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.