Timeline for Binary algebra, is it possible to partition the elements in GF(2^12) into 65 subgroups closed under addition?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 15, 2015 at 2:33 | vote | accept | bpel | ||
| Apr 14, 2015 at 21:31 | answer | added | user13113 | timeline score: 9 | |
| Apr 14, 2015 at 20:13 | history | edited | bpel | CC BY-SA 3.0 |
edited title
|
| Apr 14, 2015 at 18:34 | history | edited | bpel | CC BY-SA 3.0 |
edited body
|
| Apr 14, 2015 at 18:32 | comment | added | bpel | You are right, stress and lack of sleep are screwing with my mind... I corrected the question | |
| Apr 14, 2015 at 18:13 | comment | added | Aaron Meyerowitz | A set of (non-zero) binary vectors closed under XOR has size $2^k-1$ where $k$ is the size of the largest independent set. | |
| Apr 14, 2015 at 17:51 | comment | added | Aaron Meyerowitz | No! but 65 groups of 63 might be possible. Your small example was 5 groups of 3, not 3 groups of 5. | |
| Apr 14, 2015 at 17:35 | review | First posts | |||
| Apr 14, 2015 at 17:55 | |||||
| Apr 14, 2015 at 17:34 | history | asked | bpel | CC BY-SA 3.0 |