Timeline for Lattice-cube minimal blocking sets
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 11, 2017 at 12:08 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Image links broken; now fixed.
|
| Aug 3, 2012 at 1:48 | comment | added | Joseph O'Rourke | @ARupinski: Very nice question! Yes, the reason I (mistakenly) thought maybe my example was minimal is that it was irreducible. | |
| Aug 3, 2012 at 0:48 | comment | added | ARupinski | I was thinking about this question some more today, and I realized that your initial 10-point blocking set in $C_3(3)$ is still interesting for the following reason: it is 'irreducible' in the sense that removing any point leaves a non-blocking set. So you might also ask what the size of the largest irreducible blocking set is for $C_d(n)$; to me at least it appears much harder to obtain sharp bounds in this latter case. For $d = n = 3$ it seems to be 13 (obtained by taking the central point of each edge as well as the center of the cube), although I haven't rigorously proved this. | |
| Aug 1, 2012 at 23:26 | answer | added | ARupinski | timeline score: 2 | |
| Aug 1, 2012 at 22:46 | vote | accept | Joseph O'Rourke | ||
| Aug 1, 2012 at 22:46 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Addendum and answer.
|
| Aug 1, 2012 at 20:38 | answer | added | Eoin | timeline score: 5 | |
| Aug 1, 2012 at 20:15 | comment | added | Johan Wästlund | If I got this right, the set of points whose coordinates add to a number divisible by $n$ will have exactly one point on each such line. Does this answer the question? | |
| Aug 1, 2012 at 19:39 | comment | added | Joseph O'Rourke | @Seva: You are right!---Thanks; corrected. | |
| Aug 1, 2012 at 19:39 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
edited body; added 12 characters in body
|
| Aug 1, 2012 at 19:36 | comment | added | Seva | It is my understanding that the first line contains a typo ($d$ in $\{1,2,...,d\}$ is to be replaced with $n$). | |
| Aug 1, 2012 at 18:57 | history | asked | Joseph O'Rourke | CC BY-SA 3.0 |