On selecting a random shifted young tableau
From MaRDI portal
Publication:3921236
DOI10.1016/0196-6774(80)90010-3zbMath0468.05008OpenAlexW1986929557MaRDI QIDQ3921236
Publication date: 1980
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(80)90010-3
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)
Related Items
Commutation classes of the reduced words for the longest element of \(\mathfrak{S}_{n}\) ⋮ Bijecting hidden symmetries for skew staircase shapes ⋮ 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 ⋮ Random strict partitions and random shifted tableaux ⋮ On random shifted standard Young tableaux and 132-avoiding sorting networks ⋮ A symplectic refinement of shifted Hecke insertion ⋮ Combinatorics of patience sorting monoids ⋮ Hook formulas for skew shapes. III: Multivariate and product formulas