Timeline for Expected determinant of a random NxN matrix
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 26, 2021 at 5:29 | comment | added | Gil Kalai | @Machinato See mathoverflow.net/questions/137377/… | |
| Dec 25, 2021 at 22:56 | comment | added | Machinato | @Gil Kalai which Turan's paper does contain the formula for E[(detA)^4]? | |
| Mar 3, 2018 at 5:09 | comment | added | David E Speyer | Number of fixed points of $u$. Fixed, thanks. | |
| Mar 3, 2018 at 5:09 | history | edited | David E Speyer | CC BY-SA 3.0 |
edited body
|
| Mar 3, 2018 at 3:32 | comment | added | Gerry Myerson | There's a sum over $u$ in $S_n$, and the summand involves the number of fixed points of $i$. | |
| Feb 19, 2018 at 2:59 | comment | added | David E Speyer | I don't see an $i$ in the sum on $u$. | |
| Feb 19, 2018 at 2:58 | comment | added | David E Speyer | $\ell(v)$ is the length of the permutation $v$. In this case, it only appears in exponents: $(-1)^{\ell(v)}$ is the sign of $v$. | |
| Feb 19, 2018 at 1:41 | comment | added | Gerry Myerson | I don't know what $\ell(v)$ stands for. I don't know what $i$ stands for in the sum over $u$. | |
| Nov 9, 2017 at 8:04 | comment | added | Jean Marie Becker | see (mathoverflow.net/q/210666) | |
| Feb 4, 2010 at 3:20 | vote | accept | Jason Knight | ||
| Jan 26, 2010 at 16:15 | comment | added | Gil Kalai | There is another simple proof based on Cauchy Binet theorem. Turan published (in Chinese) a formula for the sum of the 4th power. (I think there are simpler proof but I dont know a reference). I am not aware of a formula for higher powers. | |
| Jan 26, 2010 at 15:40 | comment | added | David E Speyer | Previous version had many sign errors, I think they are fixed now. | |
| Jan 26, 2010 at 15:38 | history | edited | David E Speyer | CC BY-SA 2.5 |
deleted 16 characters in body; added 4 characters in body; deleted 6 characters in body
|
| Jan 26, 2010 at 13:26 | history | answered | David E Speyer | CC BY-SA 2.5 |