Skip to main content

Timeline for Lattice-cube minimal blocking sets

Current License: CC BY-SA 3.0

6 events
when toggle format what by license comment
Aug 2, 2012 at 11:46 comment added Joseph O'Rourke @Noam: Yes, thanks for clarifying and sharpening that question.
Aug 2, 2012 at 2:34 comment added Noam D. Elkies You mean all minimal blocking sets. It's certainly true for $n=2$ (and $n=1$...); it's false for $n>3$, for the trivial reason that there are permutations of $\lbrace 1, \ldots, n \rbrace$ that do not preserve the set of toric hyperplanes, though it might still be true up to permutations.
Aug 2, 2012 at 2:26 comment added Joseph O'Rourke @Eoin: You raise an interesting question: Are all blocking sets toric hyperplanes?
Aug 1, 2012 at 22:46 vote accept Joseph O'Rourke
Aug 1, 2012 at 21:30 history edited Eoin CC BY-SA 3.0
added 4 characters in body
Aug 1, 2012 at 20:38 history answered Eoin CC BY-SA 3.0