Timeline for n-simplex in an intersection of n balls
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 27, 2013 at 4:12 | comment | added | The Masked Avenger | Can you use this to determine where "the least coverage" is? In particular, can we say the points in the simplex are covered by an average of $o(n^2)$ spheres? Or is the average at most O(n)? | |
| Aug 27, 2013 at 3:12 | comment | added | Max | Thank you. By the "trivial question", I meant the one about where to post such questions, not the question itself :). I know the proof of Helly's theorem (via Radon's theorem). In fact, I thought about using Helly's theorem, but not the arguments in its proof. Anyway, thanks a lot again. | |
| Aug 27, 2013 at 2:50 | comment | added | fedja | It is not trivial, just fairly standard (if you know the proof of Helly's theorem and such). Try MathStackExchange or Artofproblemsolving first next time. If you fail there, then come here :) | |
| Aug 27, 2013 at 2:27 | vote | accept | Max | ||
| Aug 27, 2013 at 2:27 | comment | added | Max | Beautiful! Many-many thanks. Sorry for a trivial question, but where can I ask such type of questions? I am not a professional mathematician, and this question has appeared as a technical issue in my (applied) area. | |
| Aug 26, 2013 at 20:03 | history | answered | fedja | CC BY-SA 3.0 |