Timeline for Proof of Fisher's inequality in combinatorial terms
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 9, 2017 at 7:46 | comment | added | Dominic van der Zypen | You're right -- I just missed it. Thanks for the hint | |
| Apr 7, 2017 at 12:15 | vote | accept | Dominic van der Zypen | ||
| Apr 6, 2017 at 15:39 | answer | added | Igor Rivin | timeline score: 7 | |
| Apr 6, 2017 at 14:39 | comment | added | Tom De Medts | What do you mean? It's literally there: "At first, we denote $|\mathcal{C}|=m$ and do not assume for a moment that $m=n$, but prove that $m \leq n$." | |
| Apr 6, 2017 at 11:58 | comment | added | Dominic van der Zypen | I don't see how, can you give me a hint? | |
| Apr 6, 2017 at 10:53 | comment | added | Tom De Medts | This is shown in the answer to your earlier question mathoverflow.net/questions/266511/…. | |
| Apr 6, 2017 at 9:23 | history | asked | Dominic van der Zypen | CC BY-SA 3.0 |