Skip to main content
Log in

A bijective proof of Kadell's conjecture on plane partitions

  • Original Papers
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Kadell, Kevin W.J.: Schützenberger's “jeu de taquin” and plane partition. J. Comb. Theory (A) (to appear)

  2. Stanley, R.P.: Theory and application of plane partitions, part 1. Stud. Appl. Math.50, 167–188 (1971)

    Google Scholar 

  3. Stanley, R.P.: Theory and application of plane partitions, part 2. Stud. Appl. Math.50, 259–279 (1971)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01787728

Keywords

Navigation