On growing a random Young tableau

DOI10.1016/0097-3165(86)90085-3zbMath0603.05004OpenAlexW2002640495MaRDI QIDQ1082341

Boris G. Pittel

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0097-3165(86)90085-3

zbMATH Keywords

random walkrandom Young tableaux

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Combinatorial aspects of partitions of integers (05A17)

Related Items (5)

Explicit formulas for hook walks on continual Young diagrams ⋮ On a likely shape of the random Ferrers diagram ⋮ A \(q\)-analog of the hook walk algorithm for random Young tableaux ⋮ On the distribution of the number of Young tableaux for a uniformly random diagram ⋮ A \(q\)-analog of the hook walk algorithm and random Young tableaux

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Longest Increasing and Decreasing Subsequences
• The Hook Graphs of the Symmetric Group
• On the relations between the numbers of standard tableaux

This page was built for publication: On growing a random Young tableau