Timeline for Moments of the trace of orthogonal matrices
Current License: CC BY-SA 4.0
26 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 26, 2019 at 21:18 | history | edited | Carlo Beenakker | CC BY-SA 4.0 |
this edit was just suggested by an anonymous user, and rejected in the review queue, but it's OK with me.
|
| S Nov 26, 2019 at 19:36 | history | edited | András Bátkai | CC BY-SA 4.0 |
broken links fixed
|
| Nov 26, 2019 at 19:02 | review | Suggested edits | |||
| S Nov 26, 2019 at 19:36 | |||||
| Sep 7, 2014 at 8:15 | vote | accept | J. E. Pascoe | ||
| Sep 6, 2014 at 8:34 | history | edited | Carlo Beenakker | CC BY-SA 3.0 |
added 60 characters in body
|
| Sep 5, 2014 at 21:37 | comment | added | Suvrit | @CarloBeenakker: I've now written an explicit formula for $a_{2k}$ in my post; would be amazing if it simplifies down to your conjecture! | |
| Sep 5, 2014 at 18:36 | comment | added | Carlo Beenakker | I searched a bit, but only the $n=2$ series (A001700) and $n=3$ series (A099251) seem to be on OEIS. | |
| Sep 5, 2014 at 17:11 | history | edited | Carlo Beenakker | CC BY-SA 3.0 |
added 74 characters in body
|
| Sep 5, 2014 at 16:22 | comment | added | J. E. Pascoe | This is an amazing amount of data. I wonder if it's in any of the triangles in the OEIS (Like Pascal's triangle or Stirling numbers.) | |
| Sep 5, 2014 at 13:46 | history | edited | Carlo Beenakker | CC BY-SA 3.0 |
added 6 characters in body
|
| Sep 5, 2014 at 12:43 | history | edited | Carlo Beenakker | CC BY-SA 3.0 |
added 454 characters in body
|
| Sep 5, 2014 at 11:04 | history | edited | Carlo Beenakker | CC BY-SA 3.0 |
added 1 character in body
|
| Sep 5, 2014 at 10:49 | history | edited | Carlo Beenakker | CC BY-SA 3.0 |
deleted 112 characters in body
|
| Sep 5, 2014 at 10:42 | history | edited | Carlo Beenakker | CC BY-SA 3.0 |
deleted 112 characters in body
|
| Sep 5, 2014 at 10:35 | history | edited | Carlo Beenakker | CC BY-SA 3.0 |
deleted 112 characters in body
|
| Sep 5, 2014 at 10:26 | history | edited | Carlo Beenakker | CC BY-SA 3.0 |
added 194 characters in body
|
| Sep 5, 2014 at 10:16 | history | edited | Carlo Beenakker | CC BY-SA 3.0 |
added 346 characters in body
|
| Sep 5, 2014 at 9:53 | history | edited | Carlo Beenakker | CC BY-SA 3.0 |
added 68 characters in body
|
| Sep 5, 2014 at 9:46 | history | edited | Carlo Beenakker | CC BY-SA 3.0 |
added 68 characters in body
|
| Sep 5, 2014 at 9:04 | history | edited | Carlo Beenakker | CC BY-SA 3.0 |
deleted 35 characters in body
|
| Sep 5, 2014 at 8:57 | history | edited | Carlo Beenakker | CC BY-SA 3.0 |
deleted 35 characters in body
|
| Sep 5, 2014 at 8:50 | history | edited | Carlo Beenakker | CC BY-SA 3.0 |
added 433 characters in body
|
| Sep 4, 2014 at 21:35 | comment | added | Liviu Nicolaescu | For $n=3$ you could try using Weyl's integral formula which reduces to the computation of an integral over the maximal torus of $O(3)$. This is an $S^1$ and there is a greater hope you can say something concrete. | |
| Sep 4, 2014 at 21:23 | history | edited | Carlo Beenakker | CC BY-SA 3.0 |
added 181 characters in body
|
| Sep 4, 2014 at 21:19 | comment | added | J. E. Pascoe | Thanks. This is the formula I spotted. However, I want a formula for that holds for large $k,$ (in some sense the $n$ I am choosing is small and fixed) for example if $n=3.$ The above formula doesn't give me enough information. | |
| Sep 4, 2014 at 21:16 | history | answered | Carlo Beenakker | CC BY-SA 3.0 |