Timeline for separating points in $\mathbb{R}^d$ by minimal number of planes
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 6, 2015 at 10:28 | vote | accept | Fedor Petrov | ||
| Oct 6, 2015 at 9:38 | answer | added | Ilya Bogdanov | timeline score: 6 | |
| Oct 5, 2015 at 23:12 | comment | added | Yoav Kallus | I feel that an upper bound of something like $\sim n/d+\log(d)$ can be achieved by first dividing the points into $d$ groups of size $\sim n/d$, and then ham-sandwiching. | |
| Oct 5, 2015 at 22:52 | history | edited | Fedor Petrov | CC BY-SA 3.0 |
added 9 characters in body
|
| Oct 5, 2015 at 22:52 | comment | added | Fedor Petrov | Indeed. For even $d$ it may be improved to $n/d$, for odd $d$ I do not see this now. | |
| Oct 5, 2015 at 22:11 | comment | added | Gjergji Zaimi | Doesn't the moment curve technically give the lower bound $(n-1)/d$, or is there an obvious way to improve it to $n/d$? | |
| Oct 5, 2015 at 18:12 | history | asked | Fedor Petrov | CC BY-SA 3.0 |