Timeline for Probability of getting exactly one head and $k$-wise independence
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 5, 2020 at 19:25 | comment | added | esg | @Anush: Sorry, I have no idea what the lower bound should be for $k=3$ or any other odd $k$. (I have only found a construction which gives slightly lower (asymptotically equivalent) bounds than in the $k=4$ case.) | |
| Nov 5, 2020 at 10:15 | history | bounty ended | Simd | ||
| Nov 5, 2020 at 6:30 | comment | added | Simd | For k=3, is it possible to say what the lower bound is? | |
| Nov 4, 2020 at 20:21 | comment | added | esg | In the sum in my previous comment the upper index should be $k-1$ (sorry for the typo!). | |
| Nov 4, 2020 at 18:08 | comment | added | Gabe K | So for pairwise independence ($k=2$) the other question showed that as $d$ gets large a strict lower bound is $1/d$ so it seems like these arguments are contradicting each other. | |
| Nov 4, 2020 at 17:27 | comment | added | esg | For $k$ fixed and $d \longrightarrow \infty$ the bounds converge to $\sum_{i=0}^k \frac{(-1)^i}{i!}$ | |
| Nov 4, 2020 at 15:01 | comment | added | Gabe K | What are the asymptorics in $k$ and $d$ here? Is there a simple expression? | |
| Nov 4, 2020 at 14:47 | history | answered | esg | CC BY-SA 4.0 |