Timeline for The probability for a sequence to have small partial sums
Current License: CC BY-SA 2.5
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Apr 23, 2010 at 7:11 | vote | accept | Gil Kalai | ||
| Apr 23, 2010 at 7:11 | history | bounty ended | Gil Kalai | ||
| Mar 3, 2010 at 13:33 | comment | added | Gil Kalai | Great ! thanks a lot. I thik the relevant cases for discrapancy heuristics are when t grows much smaller than n. For example, we would like to understand the orecise growth of t so that the probability will behave like exp (logn/n) | |
| Mar 3, 2010 at 13:03 | history | edited | Douglas Zare | CC BY-SA 2.5 |
Added more information when t varies.
|
| Mar 3, 2010 at 2:16 | history | edited | Douglas Zare | CC BY-SA 2.5 |
Added eignevectors.
|
| Mar 3, 2010 at 0:43 | history | undeleted | Douglas Zare | ||
| Mar 3, 2010 at 0:42 | history | edited | Douglas Zare | CC BY-SA 2.5 |
Fixed fencepost error.; deleted 1 characters in body
|
| Mar 3, 2010 at 0:36 | history | deleted | Douglas Zare | ||
| Mar 3, 2010 at 0:31 | history | answered | Douglas Zare | CC BY-SA 2.5 |