Timeline for Important formulas in combinatorics
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 31, 2015 at 0:47 | history | edited | Dan Romik | CC BY-SA 3.0 |
Corrected math typo
|
| Aug 31, 2015 at 0:39 | comment | added | Dan Romik | Thanks for the reference. Yes, it is a very nice proof. The same proof appears in the paper "On the relations between the numbers of standard tableaux" by Rutherford (Proc. Edinburgh Math. Soc. 7 (1942), 51-54; available here. Years ago I tried to understand the connection between this proof and the Robinson-Schensted proof. I think they are equivalent (the induction hides a recursive map that is essentially a R-S insertion step) but don't remember the details. | |
| Aug 30, 2015 at 23:48 | comment | added | darij grinberg | See Proposition 1.3.3 in van Leeuwen's www-math.univ-poitiers.fr/~maavl/pdf/foata-fest.pdf for the simplest proof of $( * )$. The simplicitly of this proof suggests that the RSK algorithm is actually deeper than $( * )$. | |
| S Aug 30, 2015 at 23:39 | history | answered | Dan Romik | CC BY-SA 3.0 | |
| S Aug 30, 2015 at 23:39 | history | made wiki | Post Made Community Wiki by Dan Romik |