Timeline for Maximum number of vectors in a hypercube satisfying given conditions
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 26, 2015 at 16:48 | comment | added | Josh Brown Kramer | @kodlu, the support of $A - B$ is $B \setminus A$, which is a subset of $B$. Maybe it's not right to say it supported on $B$, but at any rate, the fact that $\mathcal{C}$ is 2-Sperner still holds. | |
| Aug 26, 2015 at 16:47 | comment | added | Josh Brown Kramer | @NoamD.Elkies, I read the problem too hastily. I kept interpreting $2^{n/2}$ as $2^{n - 1}$. With that in mind, my answer is clearly unhelpful. | |
| Aug 26, 2015 at 5:25 | comment | added | kodlu | Noam D. Elkies' comment is correct. Also, the statement $A-B$ is supported on $B$ in the answer is incorrect. | |
| Aug 26, 2015 at 4:35 | comment | added | Noam D. Elkies | The growth of the largest binomial coefficient(s) $n \choose m$ is $\sim 2^n / \sqrt{n}$. How do you get "much smaller than $2^{n/2}$"? | |
| Aug 26, 2015 at 2:11 | review | Late answers | |||
| Aug 26, 2015 at 6:11 | |||||
| Aug 26, 2015 at 1:54 | history | answered | Josh Brown Kramer | CC BY-SA 3.0 |