On the equality of two plane partition correspondences

The study of column-strict plane partitions and Young tableax has spawned numerous constructive correspondences. Among these are correspondences found in the work of Bender and Knuth that send one column-strict plane partition to another, causing a specified permutation on the numbers of parts of a given size. Another correspondence, created by Schutzenberger to act on standard Young tableaux and defined in an entirely different manner. has intimate connections with the Robinson-Schensted algorithm. In this paper, these correspondences are generalized to skew column-strict plane partitions and certain of their basic properties are considered. In particular, it is shown that the correspondence of Schutzenberger can be considered a special case of the Bender-Knuth correspondences.