On selecting a random shifted young tableau

DOI10.1016/0196-6774(80)90010-3MaRDI QIDQ3921236zbMATH OpenOpenAlexFDO

Authors Bruce E. Sagan

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

zbMATH Keywords

shifted Young tableauxshifted shape

Mathematics Subject Classification ID

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

Cited in

(10)

• Hook, line and sinker: a bijective proof of the skew shifted hook-length formula
• A symplectic refinement of shifted Hecke insertion
• Hook formulas for skew shapes. III: Multivariate and product formulas
• The weighted hook length formula
• Bijecting hidden symmetries for skew staircase shapes
• A bijective proof of the hook-length formula for skew shapes
• On random shifted standard Young tableaux and 132-avoiding sorting networks
• Commutation classes of the reduced words for the longest element of \(\mathfrak{S}_{n}\)
• Random strict partitions and random shifted tableaux
• Combinatorics of patience sorting monoids

This page was built for publication: On selecting a random shifted young tableau

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3921236)