Timeline for Some strange multinomial averaging
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 2, 2018 at 11:30 | vote | accept | Siddhartha | ||
| May 1, 2018 at 18:07 | comment | added | Siddhartha | @Darij : I was trying to estimate some error term of some characteristic coefficients of a Taylor series which come from lower bound on largest eigenvalues of a symmetric matrix (due to Walker and Mieghem, 2008). This sum appeared as in each of the error terms of inverse of exponential map combined with power matrices. | |
| May 1, 2018 at 9:40 | answer | added | Fedor Petrov | timeline score: 10 | |
| May 1, 2018 at 7:35 | comment | added | darij grinberg | The safest approach I see, by the way, is to rewrite $M\left(n+j,j;2\right)$ in terms of Stirling numbers using inclusion-exclusion. | |
| May 1, 2018 at 7:32 | comment | added | darij grinberg | By the way, where does the problem come from? | |
| May 1, 2018 at 7:29 | comment | added | Per Alexandersson | I would really like an inclusion-exlcusion-style argument for this. Perhaps multiplying both sides with n! makes it easier? Also, what is the j=1-term? Is it 0? | |
| May 1, 2018 at 7:28 | comment | added | darij grinberg | Note: $\dfrac{M\left(n+j,j;2\right)}{j!}$ is the number of set partitions of the set $\left\{1,2,\ldots,n+j\right\}$ into $j$ subsets, each of which has at least $2$ elements. Not saying that this helps, but it might be a first step. | |
| May 1, 2018 at 7:20 | history | asked | Siddhartha | CC BY-SA 3.0 |