Another involution principle-free bijective proof of Stanley's hook-content formula

DOI10.1006/jcta.1999.2979zbMath0936.05087OpenAlexW2150308869WikidataQ114234208 ScholiaQ114234208MaRDI QIDQ1806214

Christian Krattenthaler

Publication date: 20 December 1999

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

Full work available at URL: https://doi.org/10.1006/jcta.1999.2979

zbMATH Keywords

hook formulastandard tableauxjeu de taquinsemistandard tableauxhook-content formula

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10)

Related Items (19)

Watermelon uniform random generation with applications ⋮ Asymptotic and exact results on the complexity of the Novelli-Pak-Stoyanovskii algorithm ⋮ Asymptotic analysis of expectations of plane partition statistics ⋮ Partition bijections, a survey ⋮ Monomial complete intersections, the weak Lefschetz property and plane partitions ⋮ \(q\)-distributions on boxed plane partitions ⋮ Hook formulas for skew shapes. I: \(q\)-analogues and bijections ⋮ Enumeration of bounded lecture hall tableaux ⋮ An asymptotic scheme for analysis of expectations of plane partition statistics ⋮ A short combinatorial proof of dimension identities of Erickson and Hunziker ⋮ Random Sampling of Plane Partitions ⋮ On the shape of a pure 𝑂-sequence ⋮ Hook, line and sinker: a bijective proof of the skew shifted hook-length formula ⋮ The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications ⋮ The weighted hook length formula ⋮ A bijective proof of the hook-length formula for skew shapes ⋮ Shuffling algorithm for boxed plane partitions ⋮ Computations versus bijections for tiling enumeration ⋮ Advanced determinant calculus: a complement

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The story of 1,2,7,42,429,7436,..
• A bijective proof of the Hook formula for the number of column strict tableaux with bounded entries
• Reverse plane partitions and tableau hook numbers
• A bijective proof of the hook-length formula and its analogs
• Generating random elements of finite distributive lattices
• Mixing times of lozenge tiling and card shuffling Markov chains
• Method for constructing bijections for classical partition identities
• La correspondance de Robinson
• Two Algorithms for Unranking Arborescences
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• Theory and Application of Plane Partitions. Part 2
• The Hook Graphs of the Symmetric Group

This page was built for publication: Another involution principle-free bijective proof of Stanley's hook-content formula