A bijective proof of the hook-length formula for skew shapes

zbMath1410.05224MaRDI QIDQ5925178

Matjaž Konvalinka

Publication date: 15 May 2019

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: http://www.mat.univie.ac.at/~slc/wpapers/FPSAC2018//13-Konvalinka.html

zbMATH Keywords

bijectionhook-length formulaskew diagram

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Representations of finite symmetric groups (20C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weighted hook length formula. III: Shifted tableaux
• The weighted hook length formula
• A short Hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof
• A bijective proof of the Hook formula for the number of column strict tableaux with bounded entries
• A probabilistic proof of a formula for the number of Young tableaux of a given shape
• A \(q\)-analog of the hook walk algorithm for random Young tableaux
• Shifted Jack polynomials, binomial formula, and applications
• Hook formulas for skew shapes. I: \(q\)-analogues and bijections
• Asymptotics of the number of standard Young tableaux of skew shape
• Excited Young diagrams and equivariant Schubert calculus
• On selecting a random shifted young tableau
• A bijective proof of the hook-length formula
• RC-Graphs and Schubert Polynomials
• Hook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications
• The Hook Graphs of the Symmetric Group
• A bijective proof of the hook-length formula for skew shapes

This page was built for publication: A bijective proof of the hook-length formula for skew shapes