Suppose that $n$ hamsters are at the points $(1,n)$, $(2,n),\dots, (n,n)$ in the plane. They walk independently one step east with probability $p$ or one step south with probability $1-p$, until reaching the $x$-axis (a point $(k,0)$). It can be shown using symmetric function theory that the probability that their paths don't intersect is $\left(\frac{1-p}{1+p}\right)^{n\choose 2}$. Is there a simple proof? For further information see here.
-
2$\begingroup$ From the linked slides it seems such a proof would be a corollary of a 'simple proof' of Littlewood identity for the sum of Schur functions. I suppose there's some variant of RSK that proves those ? $\endgroup$– Philippe NadeauCommented Apr 15 at 6:31
-
2$\begingroup$ @PhilippeNadeau: ideally there would be no sums in the proof, since none appear in the answer. $\endgroup$– Richard StanleyCommented Apr 15 at 14:19
-
$\begingroup$ Sure, I meant that a bijective proof of Littlewood identity would certainly explain why the sum was not needed in the first place. $\endgroup$– Philippe NadeauCommented Apr 15 at 20:17
-
1$\begingroup$ Equivalent reformulation: if $A=\{(x,y)\in \mathbb{Z}^2: n\geqslant x\geqslant y\geqslant 1\}$, consider all functions $f\colon A\to \mathbb{Z}_{\geqslant 0}$ which are non-strictly increasing both in $x$ and in $y$ (this is in obvious bijection with more common objects like skew semistandard Young tableaux), and sum up the monomials $p^{\sum_{i=1}^n f(i,i)}$ over all such functions. The sum equals $(1-p)^{-n}(1-p^2)^{-{n\choose 2}}$. $\endgroup$– Fedor PetrovCommented Apr 16 at 7:23
1 Answer
The non-trivial part of the following argument is due to Fedor Ushakov (for that he gets A at my symmetric functions course).
The hamster from $(i,n)$ goes to south to $(i,i)$ for sure, otherwise their paths intersect. This already has probability $(1-p)^{{n\choose 2}}$.
After that we make a semistandard Young tableaux $T$ with at most $n$ rows and entries between 1 and $n$ (denote by $\lambda(T)$ the shape of $T$) from our collection of paths as follows: the hamster who is now at $(i,i)$ is responsible for the $(n+1-i)$-th row (which may be empty): when he makes a move to east being in the horizontal line $(\cdot,j)$, he adds a box with the number $n+1-j$ to this row, see an example.
The hamsters make $|\lambda(T)|$ moves to east and $1+2+\ldots+n=n+{n\choose 2}$ moves to south, thus the probability of this equals $p^{|\lambda(T)|}(1-p)^{n+{n\choose 2}}$. We want to prove that the sum over all Young tableaux $T$ with at most $n$ rows and entries not exceeding $n$ equals $(1+p)^{-{n\choose 2}}$. This is equivalent to the formula $$ \sum_T p^{|\lambda(T)|}=(1-p)^{-n}(1-p^2)^{-{n\choose 2}}. \tag{$\clubsuit$} $$
Note that RHS of $(\clubsuit)$ is the generating function of the sum of elements of symmetric $n\times n$ matrices $A$ with non-negative integer elements: $$ (1-p)^{-n}(1-p^2)^{-{n\choose 2}}=\sum_{A=(a_{ij})}p^{\sum a_{ij}} $$ (each diagonal element corresponds to $(1-p)^{-1}$, each pair of symmetric off-diagonal elements to $(1-p^2)^{-1}$). The bijection from matrices $A$ to semistandard Young tableaux $T$ is provided by RSK.
-
1$\begingroup$ For your last identity $\clubsuit$, see also for instance Corollary 7.13.8 of Stanley's EC2. $\endgroup$ Commented Apr 17 at 11:56