What is the most general "two in one row for A & in one column for B" theorem?

Question

Let $A$ and $B$ be two Young tableaux, i. e. Young diagrams filled with the numbers $1$, $2$, ..., $n$ for some $n$ (not necessarily the same $n$). (They need not be semistandard.)

(a) (Etingof's Lectures on Representation Theory, proof of Lemma 4.40): If $A$ and $B$ share the same Young diagram, then there exist two entries which lie in the same row of $A$ and in the same column of $B$, unless we can make $A$ and $B$ equal by permuting some elements inside their rows in $A$ and permuting some elements inside their columns in $B$.

(b) (Etingof's Lectures on Representation Theory, proof of Lemma 4.41): If the partition corresponding to $A$ is lexicographically larger than that corresponding to $B$ - but both have the same sum -, then there exist two entries which lie in the same row of $A$ and in the same column of $B$.

(c) (Serganova's Representation Notes, lecture 6, Lemma 1.4): If the Young diagram of $B$ has only one less square than $A$ but does not result from $A$ by removing one square, then there exist two entries which lie in the same row of $A$ and in the same column of $B$, or two entries which lie in the same row of $B$ and in the same column of $A$.

I am rather new to Young tableaux, and I haven't looked into Fulton, Stanley or Knuth, but maybe someone can answer on the spot whether there is a more general statement behind these three results?

Oh, and since this fits so nicely: This paper gives a wonderful proof of the Littlewood-Richardson rule, even generalized to the product of a Schur function of a Young diagram with that of a skew Young diagram. Is there a reasonable generalization to the product of two skew Young diagrams?

UPDATE: Claim (c) is wrong, as easily checked for $\lambda = \begin{array}{ccc} 5&1&3\\\\ 2& & \\\\ 4 & & \\\\ \end{array}$ and $\mu = \begin{array}{cc} 1& 2 \\\\ 4 & 3 \end{array}$.

Answer 1

I can't give you your desired "most general" theorem, but I can say a little about this. In (b), the condition "shape(A) is lexicographically larger than shape(B)" is much stronger than it needs to be: "shape(A) is not dominated by shape(B)" will yield the same conclusion (recall the dominance order on partitions: $\lambda$ dominates $\mu$ if $\lambda_1+\cdots+\lambda_i\geqslant\mu_1+\cdots+\mu_i$ for each $i$).

To prove this: suppose all the entries in each row of $A$ are in different columns of $B$. Replace each entry of $B$ with the number of the row in which it appears in $A$; then by assumption the entries in each column of (the modified) $B$ are distinct. So if we sort the entries in this tableau into increasing order, all the entries less than or equal to $i$ will appear in the top $i$ rows. Hence the number of positions in the top $i$ rows of $B$ is at least the number of entries in the top $i$ rows of $A$, i.e. $\lambda_1+\cdots+\lambda_i\geqslant\mu_1+\cdots+\mu_i$ (where $\lambda=\operatorname{shape}(B)$ and $\mu=\operatorname{shape}(A)$).

This is all assuming that $A$ and $B$ have the same size. If $A$ is bigger than $B$, then obviously it goes wrong (because then $\lambda$ can't possibly dominate $\mu$, but the conclusion could easily be false). A more general statement (I think) is the following:

if either ($|\lambda|\geqslant|\mu|$ and $\lambda\ntrianglerighteq\mu$) or ($|\lambda|\leqslant|\mu|$ and $\mu'\ntrianglerighteq\lambda'$) then there are two entries in the same row of $A$ and the same column of $B$.

(Here I'm still writing $\lambda=\operatorname{shape}(B)$ and $\mu=\operatorname{shape}(A)$, $\lambda'$ denotes the conjugate (=transpose) partition to $\lambda$, and $\trianglerighteq$ is the dominance order.)

Answer 2

Answering your last question, the Littlewood-Richardson rule has indeed been recently extended to skew shapes, see Theorem 6 in this preprint by Lam, Lauve and Sottile