In this paper a procedure (the next frame is obtained by executing a random walk on the previous frame) for growing the sequence of the random Young tableaux is presented.
Recommendations
- A q-analog of the hook walk algorithm for random Young tableaux
- Asymptotics for random Young diagrams when the word length and alphabet size simultaneously grow to infinity
- scientific article; zbMATH DE number 1303717
- 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
- 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
- scientific article; zbMATH DE number 3867332 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- Longest Increasing and Decreasing Subsequences
- On the relations between the numbers of standard tableaux
- The Hook Graphs of the Symmetric Group
Cited in
(7)- A q-analog of the hook walk algorithm for random Young tableaux
- A \(q\)-analog of the hook walk algorithm and random Young tableaux
- On a likely shape of the random Ferrers diagram
- On the distribution of the number of Young tableaux for a uniformly random diagram
- Explicit formulas for hook walks on continual Young diagrams
- An interacting particle process related to Young tableaux
- scientific article; zbMATH DE number 1744410 (Why is no real title available?)
This page was built for publication: On growing a random Young tableau
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082341)
