Skew tableaux, lattice paths, and bounded partitions
We establish a one to one correspondence between a set of certain bounded partitions and a set of two-rowed standard Young tableaux of skew shape. Then we obtain a formula for a number which enumerates these partitions. We give two proofs for this formula, one by applying the above correspondence, the other by using the reflection principle.
scientific article; zbMATH DE number 165160