Timeline for A Combinatorial Identity Involving Characters of $S_n$ (Reference Request?)
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 14, 2016 at 19:07 | vote | accept | Nathan Lindzey | ||
| Jul 14, 2016 at 12:21 | comment | added | Per Alexandersson | Feels like it is related to number of SYTs of two-row shape of equal lengths, which are easy to see are in bijection with say Dyck paths... (see Stanleys book on Catalan objects) | |
| Jul 14, 2016 at 9:50 | answer | added | Mark Wildon | timeline score: 7 | |
| Jul 14, 2016 at 9:47 | comment | added | Mark Wildon | Representing $(n,n)$ on a $2$-runner abacus, this follows very quickly from 2.7.27 in James and Kerber: we have to make $n$ upward bead moves, one bead moving up $\lfloor n/2 \rfloor$ times, and the other $\lceil n/2 \rceil$ times. (Posted as a comment since I'm sure you know this already, and its only a short proof, not the identity.) | |
| Jul 14, 2016 at 8:27 | history | asked | Nathan Lindzey | CC BY-SA 3.0 |