Timeline for Intersecting 4-sets
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 6, 2012 at 18:49 | vote | accept | Brendan McKay | ||
| Nov 6, 2012 at 14:45 | answer | added | Noam D. Elkies | timeline score: 16 | |
| Nov 6, 2012 at 14:29 | answer | added | Dima Pasechnik | timeline score: 5 | |
| Nov 6, 2012 at 4:03 | answer | added | Gordon Royle | timeline score: 8 | |
| Nov 6, 2012 at 3:47 | answer | added | Tony Huynh | timeline score: 6 | |
| Nov 6, 2012 at 3:26 | comment | added | Brendan McKay | Yes, that's about where I got stuck. | |
| Nov 6, 2012 at 2:45 | comment | added | Chris Godsil | You are asking for the maximum number of words of weight in a self-orthogonal binary code. And it seems you could reduce to the case where the minimum distance is four. (But then I am stuck.) | |
| Nov 6, 2012 at 2:44 | history | edited | Brendan McKay | CC BY-SA 3.0 |
added 143 characters in body
|
| Nov 6, 2012 at 2:35 | answer | added | Patricia Hersh | timeline score: 5 | |
| Nov 6, 2012 at 2:23 | history | asked | Brendan McKay | CC BY-SA 3.0 |