Help


from Wikipedia
« »  
Any skew semistandard tableau of shape / with positive integer entries gives rise to a sequence of partitions ( or Young diagrams ), by starting with, and taking for the partition places further in the sequence the one whose diagram is obtained from that of by adding all the boxes that contain a value ≤ in ; this partition eventually becomes equal to.
Any pair of successive shapes in such a sequence is a skew shape whose diagram contains at most one box in each column ; such shapes are called horizontal strips.
This sequence of partitions completely determines, and it is in fact possible to define ( skew ) semistandard tableaux as such sequences, as is done by Macdonald ( Macdonald 1979, p. 4 ).
Note that this definition incorporates the partitions and in the data comprising the skew tableau.

2.351 seconds.