Timeline for Choosing $n$ times from $n$ objects
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 13, 2016 at 6:53 | vote | accept | Dominic van der Zypen | ||
| Dec 12, 2016 at 17:36 | comment | added | Fedor Petrov | Kleitman lemma works, does not it? | |
| Dec 12, 2016 at 16:53 | comment | added | Ilya Bogdanov | @FedorPetrov: After a suitable generalization - maybe, but I'm not sure if just negativeness of pairwise correlations is sufficient... | |
| Dec 12, 2016 at 16:46 | comment | added | Fedor Petrov | I think, we may even say that the probability that all elements are chosen at most $k$ times does not exceed $p^n$, where $p$ is the probability that the element 1 is chosen at most $k$ times. Since these events correlate negatively. | |
| Dec 12, 2016 at 16:36 | history | answered | Ilya Bogdanov | CC BY-SA 3.0 |