In the conclusion of An Involution Principle-Free Proof of Stanley's Hook-Content Formula Krattenthaler notes that the techniques of the paper might be useful for finding bijective proofs of the enumeration of Symmetric Plane Partions. Has such a proof been found?

I am interested in generating random Symmetric Plane partitions with uniform probability faster than coupling from the past.

Any techniques for the other classes of Plane partitions would be of interest, as would similar techniques for shifted SSYT's. I know there is a version of Novelli-Pak-Stoyanovskii for shifted SYT's, something similar for SSYT's would be enlightening.

  • $\begingroup$ From what set of symmetric plane partitions do you want to choose a random one? $\endgroup$ May 17, 2015 at 1:36
  • $\begingroup$ From the partitions inside an $a\times a \times c$ box, or an $a\times a\times a$ box in the cyclicly or totally symmetric cases. $\endgroup$
    – Deinst
    May 17, 2015 at 2:37


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.