Timeline for Can Gauss sums derandomize any heuristic arguments?
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 24, 2011 at 8:07 | answer | added | user16007 | timeline score: 2 | |
| Jan 27, 2011 at 16:26 | vote | accept | Timothy Chow | ||
| Jan 22, 2011 at 10:30 | answer | added | Charles Matthews | timeline score: 9 | |
| Jan 22, 2011 at 9:03 | answer | added | Pete L. Clark | timeline score: 7 | |
| Jan 22, 2011 at 3:28 | comment | added | Kevin O'Bryant | I wouldn't expect exactly $\sqrt{p}$, and the expectation of the absolute value of the random walk isn't $\sqrt{p}$. The expectation of the square of a random walk (with $p$ unit steps) is $p$, but the square of the expectation is not the expectation of the square. | |
| Jan 22, 2011 at 3:23 | comment | added | Gerry Myerson | Speaking solely for myself, what I would expect if I were to interpret the (quadratic) Gauss sum as a random walk is that most of the time its absolute value would be pretty close to $\sqrt p$; I would not expect it to be, as it is, exactly $\sqrt p$ all the time. Higher order Gauss sums are maybe closer to what I'd expect of a random walk (I'm not sure if that makes them better or worse candidates for the sort of application you have in mind). | |
| Jan 22, 2011 at 0:54 | history | asked | Timothy Chow | CC BY-SA 2.5 |