The weighted hook length formula
From MaRDI portal
Publication:543902
DOI10.1016/J.JCTA.2011.02.004zbMATH Open1227.05034arXiv1006.0043OpenAlexW2031546273MaRDI QIDQ543902FDOQ543902
Authors: Ionuţ Ciocan-Fontanine, Matjaž Konvalinka, Igor Pak
Publication date: 17 June 2011
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Abstract: Based on the ideas in [CKP], we introduce the weighted analogue of the branching rule for the classical hook length formula, and give two proofs of this result. The first proof is completely bijective, and in a special case gives a new short combinatorial proof of the hook length formula. Our second proof is probabilistic, generalizing the (usual) hook walk proof of Green-Nijenhuis-Wilf, as well as the q-walk of Kerov. Further applications are also presented.
Full work available at URL: https://arxiv.org/abs/1006.0043
Recommendations
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)
Cites Work
- Discovering hook length formulas by an expansion technique
- Title not available (Why is that?)
- Title not available (Why is that?)
- Binomial determinants, paths, and hook length formulae
- Title not available (Why is that?)
- Title not available (Why is that?)
- Transition probabilities for continual Young diagrams and the Markov moment problem
- Quantum cohomology of Hilb\(_n(\mathbb C^2)\) and the weighted hook walk on Young diagrams
- The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications
- The Hook Graphs of the Symmetric Group
- A combinatorial problem
- A random \(q,t\)-hook walk and a sum of Pieri coefficients
- Random Sampling of Plane Partitions
- An elementary proof of the hook formula
- Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted
- 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
- Another probabilistic method in the theory of Young tableaux
- The weighted hook-length formula. II: Complementary formulas
- A Simple Proof of the Hook Length Formula
- Title not available (Why is that?)
- Bijective proofs of formulae for the number of standard Yound tableaux
- A bijective proof of the hook-length formula
- Hook length formula and geometric combinatorics
- Hook formula and related identities
- Lagrange's identity and the Hook formula
- A short Hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof
- Covariants of the symmetric group and its analogs in Weyl algebras
- The Hillman-Grassl correspondence and the enumeration of reverse plane partitions
- A new proof of a theorem of Littlewood
- Matrix correspondences of plane partitions
- Reverse plane partitions and tableau hook numbers
- Another involution principle-free bijective proof of Stanley's hook-content formula
- A bijective proof of the generating function for the number of reverse plane partitions via lattice paths
- Title not available (Why is that?)
- On selecting a random shifted young tableau
- Title not available (Why is that?)
- On A Theorem of Thrall in Combinatorial Analysis
- Title not available (Why is that?)
Cited In (18)
- Hook, line and sinker: a bijective proof of the skew shifted hook-length formula
- Title not available (Why is that?)
- On the existence of tableaux with given modular major index
- Quantum cohomology of Hilb\(_n(\mathbb C^2)\) and the weighted hook walk on Young diagrams
- On an identity of Glass and Ng concerning the hook length formula
- The weighted hook length formula. III: Shifted tableaux
- A note on some new hook-content identities
- Skew shape asymptotics, a case-based introduction
- Bijecting hidden symmetries for skew staircase shapes
- Hook inequalities
- A bijective proof of the hook-length formula for skew shapes
- An edge-weighted hook formula for labelled trees
- The weighted hook-length formula. II: Complementary formulas
- Results and conjectures on the number of standard strong marked tableaux
- Interview with Igor Pak
- Hook formulas for skew shapes. IV: Increasing tableaux and factorial Grothendieck polynomials
- Hook formulas for skew shapes. I: \(q\)-analogues and bijections
- Title not available (Why is that?)
Uses Software
This page was built for publication: The weighted hook length formula
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q543902)