The weighted hook length formula

DOI10.1016/J.JCTA.2011.02.004zbMath1227.05034arXiv1006.0043OpenAlexW2031546273MaRDI QIDQ543902

Matjaž Konvalinka, Ionuţ Ciocan-Fontanine, Igor Pak

Publication date: 17 June 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1006.0043

zbMATH Keywords

bijective proofhook-length formulaweighted analogue

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)

Related Items (14)

Interview with Igor Pak ⋮ On the existence of tableaux with given modular major index ⋮ Skew shape asymptotics, a case-based introduction ⋮ Hook formulas for skew shapes. IV: Increasing tableaux and factorial Grothendieck polynomials ⋮ Hook formulas for skew shapes. I: \(q\)-analogues and bijections ⋮ Bijecting hidden symmetries for skew staircase shapes ⋮ Quantum cohomology of Hilb\(_n(\mathbb C^2)\) and the weighted hook walk on Young diagrams ⋮ The weighted hook-length formula. II: Complementary formulas ⋮ Hook inequalities ⋮ Results and conjectures on the number of standard strong marked tableaux ⋮ Hook, line and sinker: a bijective proof of the skew shifted hook-length formula ⋮ A note on some new hook-content identities ⋮ A bijective proof of the hook-length formula for skew shapes ⋮ A bijective proof of the hook-length formula for skew shapes

Uses Software

• HookExp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum cohomology of Hilb\(_n(\mathbb C^2)\) and the weighted hook walk on Young diagrams
• Hook formula and related identities
• Lagrange's identity and the Hook formula
• A short Hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof
• The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications
• A new proof of a theorem of Littlewood
• An elementary proof of the hook formula
• Discovering hook length formulas by an expansion technique
• Binomial determinants, paths, and hook length formulae
• Matrix correspondences of plane partitions
• The Hillman-Grassl correspondence and the enumeration of reverse plane partitions
• Reverse plane partitions and tableau hook numbers
• A probabilistic proof of a formula for the number of Young tableaux of a given shape
• A random \(q,t\)-hook walk and a sum of Pieri coefficients
• A \(q\)-analog of the hook walk algorithm for random Young tableaux
• Transition probabilities for continual Young diagrams and the Markov moment problem
• Another involution principle-free bijective proof of Stanley's hook-content formula
• Covariants of the symmetric group and its analogs in Weyl algebras
• Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted
• Another probabilistic method in the theory of Young tableaux
• The weighted hook-length formula. II: Complementary formulas
• A bijective proof of the generating function for the number of reverse plane partitions via lattice paths
• Random Sampling of Plane Partitions
• A Simple Proof of the Hook Length Formula
• On selecting a random shifted young tableau
• Bijective proofs of formulae for the number of standard Yound tableaux
• A bijective proof of the hook-length formula
• On A Theorem of Thrall in Combinatorial Analysis
• The Hook Graphs of the Symmetric Group
• A combinatorial problem
• Hook length formula and geometric combinatorics

This page was built for publication: The weighted hook length formula