Timeline for Minimum cover of partitions of a set
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 20, 2010 at 13:16 | comment | added | JBL | A similar construction when $n = q^t$ and $k = q$ for some prime power $q$ is to identify the elements of $N$ with $(\mathbb{F}_q)^t$ and decompose the space into collections of parallel lines. | |
| Apr 20, 2010 at 1:43 | history | edited | Arseniy Akopyan | CC BY-SA 2.5 |
deleted 2 characters in body
|
| Apr 20, 2010 at 1:31 | history | answered | Arseniy Akopyan | CC BY-SA 2.5 |