A \(q\)-analog of the hook walk algorithm for random Young tableaux

DOI10.1023/A:1022423901412zbMath0785.05087MaRDI QIDQ1310601

Sergei Kerov

Publication date: 12 January 1994

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

zbMATH Keywords

probabilistic algorithmrandom Young tableaux\(q\)-hook walk

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10)

Related Items (11)

On the existence of tableaux with given modular major index ⋮ 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 ⋮ A unitary matrix model for \(q\)-deformed Plancherel growth ⋮ Hook, line and sinker: a bijective proof of the skew shifted hook-length formula ⋮ The weighted hook length formula ⋮ A bijective proof of the hook-length formula for skew shapes ⋮ A bijective proof of the hook-length formula for skew shapes ⋮ A probabilistic approach toward conjugacy classes in the finite general linear and unitary groups ⋮ Anisotropic Young diagrams and Jack symmetric functions

Cites Work

• Hook formula and related identities
• On growing a random Young tableau
• A probabilistic proof of a formula for the number of Young tableaux of a given shape
• Another probabilistic method in the theory of Young tableaux
• The Hook Graphs of the Symmetric Group
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A \(q\)-analog of the hook walk algorithm for random Young tableaux