10 Dec
2010
10 Dec
'10
3:56 p.m.
Obvious extension: unit spheres and n points in R3. d>3 dimensions, anyone? I too have no idea how to go about these. It seems like it would have been good for Erdos, and it deserves a place in the next edition of Discrete and Computational Geometry. Fine problem! I've lost track of where the R2 version came from. Steve Gray On 12/10/2010 12:21 PM, Allan Wechsler wrote:
I could quickly prove that 3 points can always be covered. I could not immediately prove the same for 4, though I have no doubt that it's true. My intuition is that an uncoverable set can be constructed with on the order of 15 to 20 points, but I really have no idea how to go about it.
On Fri, Dec 10, 2010 at 9:21 AM, Fred lunnon<fred.lunnon@gmail.com> wrote: