Skip to main content
18 events
when toggle format what by license comment
Aug 3, 2023 at 21:31 history edited YCor CC BY-SA 4.0
fixed typo
May 11, 2023 at 11:06 history bumped CommunityBot This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
S Apr 13, 2023 at 22:05 history bounty ended CommunityBot
S Apr 13, 2023 at 22:05 history notice removed CommunityBot
Apr 9, 2023 at 12:31 history edited dohmatob CC BY-SA 4.0
deleted 20 characters in body
Apr 7, 2023 at 19:45 history edited dohmatob CC BY-SA 4.0
edited body
Apr 7, 2023 at 19:31 answer added dohmatob timeline score: 1
Apr 7, 2023 at 15:40 comment added dohmatob I think you're right. Thanks!
Apr 7, 2023 at 3:44 comment added Jason Gaitonde I can't really follow all the notation, but why doesn't the last idea give a bound like $e^{N\log\log N/C\log N}$? If $N_1=C\log N$ for large enough $C=C(\theta)$, each $S_i$ should be at least $\log N$ with probability at least $1-1/N^2$ from Chernoff bounds, and there are $N/C\log N$ of them. This is probably tight because if $N_1=c\log N$ for small enough $c>0$, the probability a given $S_i$ is even positive is far enough away from $1$ that the overall expression won't even be positive with high probability.
S Apr 5, 2023 at 20:58 history bounty started dohmatob
S Apr 5, 2023 at 20:58 history notice added dohmatob Authoritative reference needed
Apr 3, 2023 at 21:14 history edited dohmatob CC BY-SA 4.0
added 11 characters in body
Apr 3, 2023 at 21:04 history edited dohmatob CC BY-SA 4.0
added 2511 characters in body
Apr 3, 2023 at 20:57 history edited dohmatob CC BY-SA 4.0
added 2511 characters in body
Apr 3, 2023 at 18:51 history rollback dohmatob
Rollback to Revision 2
Apr 3, 2023 at 18:47 history edited dohmatob CC BY-SA 4.0
deleted 127 characters in body
Apr 3, 2023 at 18:36 history edited dohmatob CC BY-SA 4.0
added 25 characters in body
Apr 3, 2023 at 18:23 history asked dohmatob CC BY-SA 4.0