论文信息 - On Selecting a Random Shifted Young Tableau

On Selecting a Random Shifted Young Tableau

Abstract A probabilistic algorithm of Greene, Nijenhuis, and Wilf is applied to shifted shapes. It is proved that this procedure yields a Young tableau of the given shape and that all such tableaux are equally likely.

Bruce E. Sagan | B. Sagan

[1] A. P. Hillman,et al. Reverse Plane Partitions and Tableau Hook Numbers , 1976, J. Comb. Theory A.

[2] Joseph P. S. Kung,et al. Invariant theory, Young bitableaux, and combinatorics , 1978 .

[3] C. Schensted. Longest Increasing and Decreasing Subsequences , 1961, Canadian Journal of Mathematics.

[4] R. Stanley. Theory and Application of Plane Partitions. Part 2 , 1971 .

[5] R. Stanley. Theory and applications of plane partitions: Part 1 , 1971 .

[6] E. Gansner,et al. Matrix correspondences and the enumeration of plane partitions. , 1978 .

[7] Marcel Paul Schützenberger,et al. La correspondance de Robinson , 1977 .

[8] H. Wilf,et al. A probabilistic proof of a formula for the number of Young tableaux of a given shape , 1979 .

[9] J. S. Frame,et al. The Hook Graphs of the Symmetric Group , 1954, Canadian Journal of Mathematics.

[10] Alfred Young. On Quantitative Substitutional Analysis , 1930 .

[11] D. Foata,et al. Combinatoire et Représentation du Groupe Symétrique , 1977 .