Abstract
We give a weight-preserving bijection fromℱ m r, µ to
, whereℱ m r, µ is the set of all plane partitions whose entries are ≤m and whose entries below ther-th row form a column strict plane partition of typeμ, andℱ m µ the set of all column strict plane partitions of typeμ whose entries are ≤m, and
the set of all plane partitions with at mostr rows, whose entries are ≤m. This confirms a conjecture of Kadell.
Similar content being viewed by others
References
Kadell, Kevin W.J.: Schützenberger's “jeu de taquin” and plane partition. J. Comb. Theory (A) (to appear)
Stanley, R.P.: Theory and application of plane partitions, part 1. Stud. Appl. Math.50, 167–188 (1971)
Stanley, R.P.: Theory and application of plane partitions, part 2. Stud. Appl. Math.50, 259–279 (1971)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kim, D. A bijective proof of Kadell's conjecture on plane partitions. Graphs and Combinatorics 6, 173–178 (1990). https://doi.org/10.1007/BF01787728
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01787728