Timeline for How to prove $\prod_{\lambda\vdash n}\prod_im_i(\lambda)!=\prod_{\lambda\vdash n}1^{m_1(\lambda)}2^{m_2(\lambda)}\cdots$
Current License: CC BY-SA 3.0
11 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jan 26, 2019 at 21:25 | review | Close votes | |||
Jan 27, 2019 at 18:17 | |||||
Dec 23, 2018 at 18:02 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
Nov 23, 2018 at 16:53 | answer | added | JMP | timeline score: 1 | |
Oct 19, 2015 at 17:37 | comment | added | Ben Barber | @RichardStanley I'm afraid at this point, neither do I. | |
Oct 19, 2015 at 16:41 | comment | added | Richard Stanley | See Enumerative Combinatorics, vol. 1, 2nd ed., Exercise 1.80. (Incidentally, I don't understand the comment of Ben Barber.) | |
Oct 19, 2015 at 14:35 | comment | added | Ben Barber | Write the terms of each product on the left-hand side inside the Young/Ferrers diagram for $\lambda$ and meditate on the result. | |
Oct 19, 2015 at 13:30 | comment | added | Per Alexandersson | The left hand side, looks like something you might get from taking a coefficient of say $x_1x_2\cdots x_n$ in the sum of all Schur polynomials of degree $n$ expanded in monomial basis, and the right hand side, a similar thing but expanded in the power-sum symmetric basis. en.wikipedia.org/wiki/Schur_polynomial | |
Oct 19, 2015 at 13:30 | review | Close votes | |||
Oct 21, 2015 at 12:59 | |||||
Oct 19, 2015 at 13:19 | history | edited | Frank Z.K. Li | CC BY-SA 3.0 |
added 1 character in body
|
Oct 19, 2015 at 13:11 | history | edited | Frank Z.K. Li | CC BY-SA 3.0 |
edited title
|
Oct 19, 2015 at 13:02 | history | asked | Frank Z.K. Li | CC BY-SA 3.0 |