Recently I am reading Professor Bressoud's book "Proofs and confirmations"。And chapter 4 of his book is about using Schur functions to prove Macmahon's conjecture on symmetric plane partitions: compute the genetaring function for plane partitions in box $B(r,r,t)$ that are symmetric about their first two coorbinates. His method is Macdonald's, which employs Weyl's determinant on root systems. The crucial step is to prove the following equation and put the right end into a product of the $x_i$'s.

where $\lambda$ runs over all partions contained in a $r\times t$ rectangle.

The proof in quite "tedious",because it involves a determinant expansion and their are a bunch of transformations of the summations. But with the RSK correspondence, its not hard to prove this identity:

here $\lambda$ runs over all partitions whose length is $\leq r$.
(I learned this in Stanley's book )
and what we really want is the following

$$\sum_{\lambda\subseteq \{t^r\}} s_{\lambda}(x_1,\cdots,x_r) =?$$

(it's good to have a product of the $x_i$'s at the right hand.)
So my questions is, can we find a more direct way to proof Macmahon's conjecture with the help of RSK correspondence, especially find a nicer way to express the

1 Answer
1

I doubt it... as far as I know, the RSK correspondence isn't very well-behaved on the set of Young tableaux that you need.

This doesn't entirely rule out the possibility of other "nice" proofs, though with current technology, I think you'll need to do a determinant evaluation at some point for this particular problem. That's not necessarily a bad thing, as there are some rather astonishing modern ways of evaluating determinants, especially those coming from tiling problems, plane partitions and the like.